Discrete Mathematics, Volume 310

Volume 310, Number 1, January 2010

• Xinrong Ma:
  Magic determinants of Somos sequences and theta functions. 1-5
  
• Yusuke Suzuki:
  Optimal 1-planar graphs which triangulate other surfaces. 6-11
  
• Xiaoshan Kai, Shixin Zhu:
  On the distances of cyclic codes of length 2^e over Z₄. 12-20
  
• Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
  Polychromatic colorings of arbitrary rectangular partitions. 21-30
  
• C. Anderson, Jonathan Cutler, A. J. Radcliffe, Lorenzo Traldi:
  On the interlace polynomials of forests. 31-36
  
• Martin Knor, Sanming Zhou:
  Diameter and connectivity of 3-arc graphs. 37-42
  
• Olof Heden, Martin Hessler, Thomas Westerbäck:
  On the classification of perfect codes: Extended side class structures. 43-55
  
• John P. McSorley, John A. Trono:
  On k-minimum and m-minimum edge-magic injections of graphs. 56-69
  
• Wei Wang, Cheng-Xian Xu:
  On the asymptotic behavior of graphs determined by their generalized spectra. 70-76
  
• Márton Naszódi, Steven Taschuk:
  On the transversal number and VC-dimension of families of positive homothets of a convex body. 77-82
  
• Xiaojing Chen, Wenchang Chu:
  Dixon's ₃F₂(1)-series and identities involving harmonic numbers and the Riemann zeta function. 83-91
  
• Jeremy Aikin, Carolyn Chun, Rhiannon Hall, Dillon Mayhew:
  Internally 4-connected binary matroids with cyclically sequential orderings. 92-108
  
• Mira-Cristiana Anisiu, Valeriu Anisiu, Zoltán Kása:
  Total palindrome complexity of finite words. 109-114
  
• Joshua Brown Kramer:
  Fractional set systems with few disjoint pairs. 115-124
  
• Vladimir Nikiforov:
  Turán's theorem inverted. 125-131
  
• Bernard Ries, Cédric Bentz, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Rico Zenklusen:
  Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. 132-146
  
• Yingqian Wang, Huajing Lu, Ming Chen:
  Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. 147-158
  
• Shimin Yu, Fang-Ming Shao, Huajun Meng:
  Uniformly optimal graphs in some classes of graphs with node failures. 159-166
  
• Oleg V. Borodin, Mickaël Montassier, André Raspaud:
  Planar graphs without adjacent cycles of length at most seven are 3-colorable. 167-173
  
• Iain Moffatt:
  Partial duality and Bollobás and Riordan's ribbon graph polynomial. 174-183
  
• Stasys Jukna:
  Representing (0, 1)-matrices by boolean circuits. 184-187
  
• Meysam Alishahi, Hossein Hajiabolhassan, Ali Taherkhani:
  A generalization of the Erdös-Ko-Rado theorem. 188-191
  
• Jana Tomanová:
  A note on vertex-transitive non-Cayley graphs from Cayley graphs generated by involutions. 192-195
  

Volume 310, Number 2, January 2010

• Keith J. Edwards, Terry S. Griggs, Jan van den Heuvel, Stephanie Perkins, Bridget S. Webb, Vadim E. Zverovich:
  Preface. 197-198
  
• Stephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz:
  Edge colouring by total labellings. 199-205
  
• Jason D. Rudd:
  Tutte polynomials for counting and classifying orbits. 206-222
  
• Louigi Addario-Berry, Louis Esperet, Ross J. Kang, Colin J. H. McDiarmid, Alexandre Pinlou:
  Acyclic improper colourings of graphs with bounded maximum degree. 223-229
  
• Peter J. Cameron, Thomas Prellberg, Dudley Stark:
  Asymptotic enumeration of 2-covers and line graphs. 230-240
  
• Elizabeth J. Billington, Nicholas J. Cavenagh, Benjamin R. Smith:
  Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts. 241-254
  
• Nawel Kahoul, Abdelhafid Berrachedi:
  Cycle-regular graphs of (0, lambda)-graph type. 255-259
  
• Lyes Dekar, Brice Effantin, Hamamache Kheddouci:
  [r, s, t]-coloring of trees and bipartite graphs. 260-269
  
• Bill Jackson, Tibor Jordán:
  Brick partitions of graphs. 270-275
  
• David Cariolaro, Hung-Lin Fu:
  Covering graphs with matchings of fixed size. 276-287
  
• Anthony J. W. Hilton:
  Degree-bounded factorizations of bipartite multigraphs and of pseudographs. 288-302
  
• John Arhin:
  Every SOMA(n-2, n) is Trojan. 303-311
  
• Ian Anderson, Donald A. Preece:
  Combinatorially fruitful properties of 3.2^-1 and 3.2^-2 modulo p. 312-324
  
• Michael B. Smyth, Rueiher Tsaur, Iain Stewart:
  Topological graph dimension. 325-329
  
• J. Keith Dugdale, Stanley Fiorini, Anthony J. W. Hilton, John Baptist Gauci:
  Continuous k-to-1 functions between complete graphs of even order. 330-346
  
• Peter J. Cameron:
  Research Problems from the BCC21. 347-354
  
• Bert Randerath, Preben D. Vestergaard:
  All P₃-equipackable graphs. 355-359
  
• Adam R. Philpotts, Robert J. Waters:
  Solution to a problem of Nicolas Lichiardopol. 360-363
  
• Alewyn P. Burger, Christina M. Mynhardt:
  Regular graphs are not universal fixers. 364-368
  

Volume 310, Number 3, February 2010

• Jan Kratochvíl, Jaroslav Nesetril, Zdenek Ryjácek:
  Preface. 371-372
  
• Anthony Bonato, Dejan Delic, Igor Dolinka:
  All countable monoids embed into the monoid of the infinite random graph. 373-375
  
• Václav Koubek, Vojtech Rödl:
  On the number of graphs with a given endomorphism monoid. 376-384
  
• Eckhard Steffen:
  Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. 385-389
  
• Daniel Berend, Ephraim Korach, Shira Zucker:
  Anticoloring and separation of graphs. 390-399
  
• Stanislav Jendrol, Jozef Miskuf, Roman Sotak:
  Total edge irregularity strength of complete graphs and complete bipartite graphs. 400-407
  
• Peter J. Cameron, Taoyang Wu:
  The complexity of the weight problem for permutation and matrix groups. 408-416
  
• Róbert Hajduk, Roman Sotak:
  On large light graphs in families of polyhedral graphs. 417-422
  
• P. V. Skums, S. V. Suzdal, R. I. Tyshkevich:
  Operator decomposition of graphs and the reconstruction conjecture. 423-429
  
• Isidoro Gitler, Enrique Reyes, Rafael H. Villarreal:
  Ring graphs and complete intersection toric ideals. 430-441
  
• Mirko Hornák, Jana Zlámalová:
  Another step towards proving a conjecture by Plummer and Toft. 442-452
  
• Norihide Tokushige:
  A multiply intersecting Erdos-Ko-Rado theorem - The principal case. 453-460
  
• Zsolt Tuza:
  Hall number for list colorings of graphs: Extremal results. 461-470
  
• Shalom Eliahou, Michel Kervaire:
  Minimal sumsets in finite solvable groups. 471-479
  
• Anders Sune Pedersen, Bjarne Toft:
  A basic elementary extension of the Duchet-Meyniel theorem. 480-488
  
• Gabriela Araujo-Pardo, Mika Olsen:
  A conjecture of Neumann-Lara on infinite families of r-dichromatic circulant tournaments. 489-492
  
• Arnaud Pêcher, Annegret Katrin Wagler:
  On facets of stable set polytopes of claw-free graphs with stability number 3. 493-498
  
• Esmeralda Nastase, Vojtech Rödl, Mark H. Siggers:
  Note on robust critical graphs with large odd girth. 499-504
  
• L'ubomír Török, Imrich Vrt'o:
  Antibandwidth of three-dimensional meshes. 505-510
  
• Miguel Angel Fiol, Margarida Mitjana:
  The local spectra of regular line graphs. 511-517
  
• Alexander Mednykh, Roman Nedela:
  Enumeration of unrooted hypermaps of a given genus. 518-526
  
• Ladislav Nebesky:
  Distance-hereditary graphs and signpost systems. 527-530
  
• Josep Díaz, Marcin Kaminski, Dimitrios M. Thilikos:
  A note on the subgraphs of the (2× INFINITY )-grid. 531-536
  
• Dalibor Froncek, Petr Kovár, Tereza Kovarova, Michael Kubesa:
  Factorizations of complete graphs into caterpillars of diameter 5. 537-556
  
• Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni:
  Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. 557-560
  
• Robert Berke, Dieter Mitsche:
  Colorings at minimum cost. 561-569
  
• Zdenek Ryjácek, Zdzislaw Skupien, Petr Vrána:
  On cycle lengths in claw-free graphs with complete closure. 570-574
  
• Vsevolod F. Lev:
  Sums and differences along Hamiltonian cycles. 575-584
  
• Alain Doyon, Gena Hahn, André Raspaud:
  Some bounds on the injective chromatic number of graphs. 585-590
  
• Peter J. Cameron, Mihyun Kang, Dudley Stark:
  Random preorders and alignments. 591-603
  
• Peter J. Cameron, Deborah C. Lockett:
  Posets, homomorphisms and homogeneity. 604-613
  
• Andrew D. King, Gary MacGillivray:
  The firefighter problem for cubic graphs. 614-621
  
• Steve Butler, Jia Mao, Ronald L. Graham:
  How to play the Majority game with a liar. 622-629
  
• Ian Levitt, Gábor N. Sárközy, Endre Szemerédi:
  How to avoid using the Regularity Lemma: Pósa's conjecture revisited. 630-641
  
• Zdenek Dvorak, Daniel Král', Jakub Teska:
  Toughness threshold for the existence of 2-walks in K₄-minor-free graphs. 642-651
  
• Frantisek Kardos:
  Fulleroids with dihedral symmetry. 652-661
  
• Stephan Brandt:
  Triangle-free graphs whose independence number equals the degree. 662-669
  

Volume 310, Number 4, February 2010

• Shonda Gosselin:
  Vertex-transitive self-complementary uniform hypergraphs of prime order. 671-680
  
• Agnieszka Görlich, Monika Pilsniak:
  A note on an embedding problem in transitive tournaments. 681-686
  
• Daniel Gross, Nathan Kahl, John T. Saccoman:
  Graphs with the maximum or minimum number of 1-factors. 687-691
  
• Diane M. Donovan, Ales Drápal, Mike J. Grannell, Terry S. Griggs, James G. Lefevre:
  Quarter-regular biembeddings of Latin squares. 692-699
  
• Z. Tian, R. Wei:
  Decomposing triples into cyclic designs. 700-713
  
• Jun Guo, Kaishun Wang:
  Posets associated with subspaces in a d-bounded distance-regular graph. 714-719
  
• Jiuqiang Liu, Xiaodong Liu:
  Cross L-intersecting families on set systems. 720-726
  
• Aidan Roy:
  Minimal Euclidean representations of graphs. 727-733
  
• Van Bang Le, Nguyen Ngoc Tuy:
  The square of a block graph. 734-741
  
• Yair Caro, Raphael Yuster:
  Large induced subgraphs with equated maximum degree. 742-747
  
• Yuuki Tanaka, Yosuke Kikuchi, Toru Araki, Yukio Shibata:
  Bipancyclic properties of Cayley graphs generated by transpositions. 748-754
  
• Bart De Bruyn, Pieter Vandecasteele:
  The valuations of the near octagon G₄. 755-766
  
• Mirko Lepovic:
  Some new results on walk regular graphs which are cospectral to its complement. 767-773
  
• Domingos Dellamonica Jr., Colton Magnant, Daniel M. Martin:
  Rainbow paths. 774-781
  
• Hirobumi Mizuno, Iwao Sato:
  Scattering matrices of regular coverings of graphs. 782-791
  
• Mordecai J. Golin, Xuerong Yong, Yuanping Zhang:
  The asymptotic number of spanning trees in circulant graphs. 792-803
  
• Bahman Khosravi, Mojgan Mahmoudi:
  On Cayley graphs of rectangular groups. 804-811
  
• Ligong Wang, Qi Wang:
  Integral complete multipartite graphs K_{a1.p1, a2.p2, ..., as.ps} with s=5, 6. 812-818
  
• Koji Nuida:
  A characterization of signed graphs with generalized perfect elimination orderings. 819-831
  
• Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
  Some remarks on the geodetic number of a graph. 832-837
  
• Anna S. Lladó, S. C. López, Jordi Moragas:
  Every tree is a large subtree of a tree that decomposes K_n or K_{n, n}. 838-842
  
• Amitabha Tripathi, Sushmita Venugopalan, Douglas B. West:
  A short constructive proof of the Erdos-Gallai characterization of graphic lists. 843-844
  
• Jean Daligault, Daniel Gonçalves, Michaël Rao:
  Diamond-free circle graphs are Helly circle. 845-849
  
• Dirk Meierling, Lutz Volkmann:
  Cycle factors in strongly connected local tournaments. 850-860
  
• Byungchan Kim:
  On inequalities and linear relations for 7-core partitions. 861-868
  
• Brendon Rhoades:
  Hall-Littlewood polynomials and fixed point enumeration. 869-876
  
• Fu-Tao Hu, Jian-Wei Wang, Jun-Ming Xu:
  A new class of transitive graphs. 877-886
  
• Lidong Wang, Renwang Su:
  On the existence of maximum resolvable (K₄-e)-packings. 887-896
  
• Andreas Brandstädt, Christian Hundt, Federico Mancini, Peter Wagner:
  Rooted directed path graphs are leaf powers. 897-910
  
• Steve Kirkland:
  Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality. 911-921
  
• Péter Hajnal, Gábor Nagy:
  Simply sequentially additive labelings of 2-regular graphs. 922-928
  
• Lan Lei, Xiao-Min Li, Bin Wang, Hong-Jian Lai:
  On (s, t)-supereulerian graphs in locally highly connected graphs. 929-934
  
• Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
  A new upper bound on the queuenumber of hypercubes. 935-939
  
• Simon Mukwembi:
  On diameter and inverse degree of a graph. 940-946
  
• Mingqing Zhai, Ruifang Liu, Jinlong Shu:
  Minimizing the least eigenvalue of unicyclic graphs with fixed diameter. 947-955
  
• Adrian Dumitrescu, Minghui Jiang:
  Monochromatic simplices of any volume. 956-960
  
• Alexander E. Patkowski:
  A note on the rank parity function. 961-965
  
• Rudi Penne:
  A note on certain de Bruijn sequences with forbidden subsequences. 966-969
  
• Horst Trinker:
  New explicit bounds for ordered codes and (t, m, s)-nets. 970-975
  

Volume 310, Number 5, March 2010

• András Gyárfás, Gábor N. Sárközy:
  Gallai colorings of non-complete graphs. 977-980
  
• Jun Yuan, Aixia Liu:
  Sufficient conditions for lambda_k-optimality in triangle-free graphs. 981-987
  
• Jongsung Kim, Seokhie Hong, Jongin Lim:
  Impossible differential cryptanalysis using matrix method. 988-1002
  
• Dalibor Froncek, Petr Kovár, Michael Kubesa:
  Decompositions of complete graphs into blown-up cycles C_m[2]. 1003-1015
  
• Graham Brightwell, Viresh Patel:
  Average relational distance in linear extensions of posets. 1016-1021
  
• David Howard, Randy Shull, Noah Streib, Ann N. Trenk:
  The total linear discrepancy of an ordered set. 1022-1025
  
• Shang-wang Tan:
  On the Laplacian spectral radius of weighted trees with a positive weight set. 1026-1036
  
• Ganesh Dutta, Premadhis Das, Nripes K. Mandal:
  Optimum covariate designs in a binary proper equi-replicate block design set-up. 1037-1049
  
• Xiangjuan Yao, Xiangwen Li, Hong-Jian Lai:
  Degree conditions for group connectivity. 1050-1058
  
• Jenq-Jong Lin:
  Decomposition of balanced complete bipartite multigraphs into multistars. 1059-1065
  
• R. Julian R. Abel, Frank E. Bennett:
  Super-simple, pan-orientable and pan-decomposable GDDs with block size 4. 1066-1079
  
• R. Julian R. Abel, Diana Combe, Adrian M. Nelson, William D. Palmer:
  GBRDs over groups of orders <=100 or of order pq with p, q primes. 1080-1088
  
• Diogo Vieira Andrade, Endre Boros, Vladimir Gurvich:
  Not complementary connected and not CIS d-graphs form weakly monotone families. 1089-1096
  
• Stefan Felsner, Ching Man Li, William T. Trotter:
  Adjacency posets of planar graphs. 1097-1104
  
• Yong-Gao Chen, Hong-Xia Yang:
  Sequences of integers with missing quotients. 1105-1111
  
• Stefan Steinerberger:
  A note on the number of different inner products generated by a finite set of vectors. 1112-1117
  
• Mario Valencia-Pabon:
  Idomatic partitions of direct products of complete graphs. 1118-1122
  
• Shaohui Zhai, Claudio L. Lucchesi, Xiaofeng Guo:
  A lower bound on the number of removable ears of 1-extendable graphs. 1123-1126
  
• Xingwu Xia, Pingzhi Yuan:
  Indexes of unsplittable minimal zero-sum sequences of length II(C_n)-1. 1127-1133
  

Volume 310, Numbers 6-7, April 2010

• Endre Boros, Vladimir Gurvich, Kazuhisa Makino, Dávid Papp:
  Acyclic, or totally tight, two-person game forms: Characterization and main properties. 1135-1151
  
• Joshua N. Cooper, Christine E. Heitsch:
  The discrepancy of the lex-least de Bruijn sequence. 1152-1159
  
• Hidefumi Ohsugi:
  Normality of cut polytopes of graphs is a minor closed property. 1160-1166
  
• Douglas R. Woodall:
  The average degree of a multigraph critical with respect to edge or total choosability. 1167-1171
  
• Aneta Dudek, Andrzej Zak, Gyula Y. Katona:
  Hamilton-chain saturated hypergraphs. 1172-1176
  
• Sergey V. Savchenko:
  On the number of non-critical vertices in strong tournaments of order N with minimum out-degree delta⁺ and in-degree delta^-. 1177-1183
  
• Antonio Breda d'Azevedo, Alexander Mednykh, Roman Nedela:
  Enumeration of maps regardless of genus: Geometric approach. 1184-1203
  
• M. I. Ostrovskii:
  Minimum congestion spanning trees in planar graphs. 1204-1209
  
• Talip Atajan, Xuerong Yong, Hiroshi Inaba:
  An efficient approach for counting the number of spanning trees in circulant and related graphs. 1210-1221
  
• Daniel Pellicer:
  A construction of higher rank chiral polytopes. 1222-1237
  
• Emilie Charlier, Tomi Kärki, Michel Rigo:
  Multidimensional generalized automatic sequences and shape-symmetric morphic words. 1238-1252
  
• Wanzhou Ye, Mingtao Zhang, Yali Ma:
  Structure of recurrent sequences of median filters. 1253-1258
  
• Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luerbio Faria, Celina M. Herrera de Figueiredo, Sulamita Klein:
  2K₂ vertex-set partition into nonempty parts. 1259-1264
  
• Klaus Dohmen, Peter Tittmann:
  Bonferroni-type inequalities and binomially bounded functions. 1265-1268
  
• Edward Dobson:
  On a conjecture of Spiga. 1269-1271
  
• Imrich Vrt'o:
  A note on isoperimetric peaks of complete trees. 1272-1274
  

Volume 310, Number 8, April 2010

• Roland Kaschek:
  On wreathed lexicographic products of graphs. 1275-1281
  
• B. Omidi Koma, Daniel Panario, Qiang Wang:
  The number of irreducible polynomials of degree n over F_q with given trace and constant terms. 1282-1292
  
• A. A. G. Ngurah, A. N. M. Salman, L. Susilowati:
  H-supermagic labelings of graphs. 1293-1300
  
• Gabriela Araujo-Pardo, Camino Balbuena, T. Héger:
  Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages. 1301-1306
  
• R. S. D. Thomas:
  Isonemal prefabrics with no axes of symmetry. 1307-1324
  
• Susan A. van Aardt, Jean E. Dunbar, Marietjie Frick, Peter Katrenic, Morten Hegner Nielsen, Ortrud R. Oellermann:
  Traceability of k-traceable oriented graphs. 1325-1333
  
• Péter Csorba, József Osztényi:
  On the topological lower bound for the multichromatic number. 1334-1339
  
• Brian Benson, Deeparnab Chakrabarty, Prasad Tetali:
  G-parking functions, acyclic orientations and spanning trees. 1340-1353
  
• Raul Cordovil, Manoel Lemos:
  The 3-connected matroids with circumference 6. 1354-1365
  
• Shonda Gosselin:
  Generating self-complementary uniform hypergraphs. 1366-1372
  
• Mirko Lepovic:
  Some characterizations of strongly regular graphs with respect to their vertex deleted subgraphs. 1373-1380
  
• Justin McInroy, Sergey Shpectorov:
  On the simple connectedness of hyperplane complements in dual polar spaces, II. 1381-1388
  
• Italo J. Dejter:
  On a C₄-ultrahomogeneous oriented graph. 1389-1391
  
• S. Benecke, Christina M. Mynhardt:
  Domination of generalized Cartesian products. 1392-1397
  
• Jang Soo Kim:
  A note on the total number of cycles of even and odd permutations. 1398-1400
  
• Demetres Christofides:
  Influences of monotone Boolean functions. 1401-1402
  
• Ales Drápal, Petr Lisonek:
  Generating spherical Eulerian triangulations. 1403-1405
  

Volume 310, Number 9, May 2010

• Mirko Hornák, Stanislav Jendrol:
  Preface. 1407
  
• Martin Baca, Petr Kovár, Andrea Semanicová-Fenovcíková, Muhammad Kashif Shafiq:
  On super (a, 1)-edge-antimagic total labelings of regular graphs. 1408-1412
  
• Matthew Johnson, Daniël Paulusma, Chantal Wood:
  Path factors and parallel knock-out schemes of almost claw-free graphs. 1413-1423
  
• Jørgen Bang-Jensen, Tibor Jordán:
  Spanning 2-strong tournaments in 3-strong semicomplete digraphs. 1424-1428
  
• Anja Kohl, Ingo Schiermeyer:
  Some results on Reed's Conjecture about omega, Delta, and chi with respect to alpha. 1429-1438
  
• Mária Zdímalová:
  Revisiting the Comellas-Fiol-Gómez constructions of large digraphs of given degree and diameter. 1439-1444
  
• Mieczyslaw Borowiecki, Anna Fiedorowicz:
  Acyclic edge colouring of planar graphs without short cycles. 1445-1455
  
• Jochen Harant, Dieter Rautenbach, Peter Recht, Friedrich Regen:
  Packing edge-disjoint cycles in graphs and the cyclomatic number. 1456-1462
  
• Csilla Bujtás, Zsolt Tuza:
  Color-bounded hypergraphs, IV: Stable colorings of hypertrees. 1463-1474
  
• Marián Klesc:
  The crossing numbers of join of the special graph on six vertices with path and cycle. 1475-1481
  
• Marie Asté, Frédéric Havet, Cláudia Linhares Sales:
  Grundy number and products of graphs. 1482-1490
  
• Frank Göring, Jochen Harant:
  Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs. 1491-1494
  
• Gábor Bacsó, Heinz A. Jung, Zsolt Tuza:
  Infinite versus finite graph domination. 1495-1500
  
• Halina Bielak:
  Ramsey numbers for a disjoint union of good graphs. 1501-1505
  

Volume 310, Numbers 10-11, June 2010

• Cynthia Loten:
  Absolute retracts and varieties generated by chordal graphs. 1507-1519
  
• Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu:
  Decomposition of sparse graphs, with application to game coloring number. 1520-1523
  
• Andrzej Dudek:
  On k-partite hypergraphs with the induced epsilon-density property. 1524-1530
  
• Jan Florek:
  On Barnette's conjecture. 1531-1535
  
• Diptendu Bhowmick, L. Sunil Chandran:
  Boxicity and cubicity of asteroidal triple free graphs. 1536-1543
  
• Meysam Alishahi, Hossein Hajiabolhassan:
  Circular coloring and Mycielski construction. 1544-1550
  
• Moharram N. Iradmusa:
  On colorings of graph fractional powers. 1551-1556
  
• Tomás Gavenciak:
  Cop-win graphs with maximum capture-time. 1557-1563
  
• Zdenek Ryjácek, Khikmat Saburov:
  Closure and forbidden pairs for 2-factors. 1564-1572
  
• Zdenek Ryjácek, Liming Xiong, Kiyoshi Yoshimoto:
  Closure concept for 2-factors in claw-free graphs. 1573-1579
  
• Petros A. Petrosyan:
  Interval edge-colorings of complete graphs and n-dimensional cubes. 1580-1587
  
• Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan:
  On disjoint matchings in cubic graphs. 1588-1613
  
• Ze-Tu Gao, Jian-Hua Yin:
  The proof of a conjecture due to Snevily. 1614-1621
  
• Gabriela Araujo-Pardo:
  On upper bounds of odd girth cages. 1622-1626
  
• C. R. Johnson, S. Nasserasr:
  Note: TP₂=Bruhat. 1627-1628
  
• M. Emami, O. Naserian:
  Some new large sets of t-designs. 1629-1632
  
• Heesung Shin, Jiang Zeng:
  An involution for symmetry of hook length and part length of pointed partitions. 1633-1639
  
• Binlong Li, Shenggui Zhang:
  On extremal weighted digraphs with no heavy paths. 1640-1644
  
• Mingyong Feng, Rudy X. J. Liu:
  Note on set systems without a strong simplex. 1645-1647
  
• Michael A. Henning:
  Erratum to: "Local edge domination critical graphs" [Discrete Mathematics 161 (1996) 175-184]. 1648
  
• Hasti Hamidzade, Dariush Kiani:
  Erratum to "The lollipop graph is determined by its Q-spectrum". 1649
  

Volume 310, Number 12, June 2010

• Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski:
  Preface. 1651-1652
  
• Primoz Luksic, Tomaz Pisanski:
  Distance-residual subgraphs. 1653-1660
  
• Barbora Ferencová, Tomás Madaras:
  Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight. 1661-1675
  
• Tomislav Doslic, Frode Måløy:
  Chain hexagonal cacti: Matchings and independent sets. 1676-1690
  
• Richard Hammack:
  A quasicancellation property for the direct product of graphs. 1691-1696
  
• Iztok Banic, Janez Zerovnik:
  Wide diameter of Cartesian graph bundles. 1697-1701
  
• Daniel Pellicer:
  Extensions of dually bipartite regular polytopes. 1702-1707
  
• Francesco Belardo, Enzo Maria Li Marzi, Slobodan K. Simic:
  Trees with minimal index and diameter at most four. 1708-1714
  
• Janja Jerebic, Sandi Klavzar:
  The distinguishing chromatic number of Cartesian products of two complete graphs. 1715-1720
  
• Xiuyun Wang, Yan-Quan Feng:
  There exists no tetravalent half-arc-transitive graph of order 2p². 1721-1724
  
• Jin-Xin Zhou, Yan-Quan Feng:
  On symmetric graphs of valency five. 1725-1732
  
• Mirko Hornák, Roman Sotak:
  General neighbour-distinguishing index via chromatic number. 1733-1736
  
• Primoz Sparl:
  Almost all quartic half-arc-transitive weak metacirculants of Class II are of Class IV. 1737-1742
  
• Shao-Fei Du, Jin Ho Kwak:
  Nonorientable regular embeddings of graphs of order p². 1743-1751
  
• Changqun Wang, Yanhua Hao:
  Edge-transitive regular Z_n-covers of the Heawood graph. 1752-1758
  
• Barry Monson, Egon Schulte:
  Locally toroidal polytopes and modular linear groups. 1759-1771
  
• Marko Lovrecic Sarazin, Dragan Marusic:
  Vertex-transitive expansions of (1, 3)-trees. 1772-1782
  
• Boris Horvat, Tomaz Pisanski:
  Products of unit distance graphs. 1783-1792
  
• Yoomi Rho:
  On Kramer-Mesner matrix partitioning conjecture. 1793-1801
  
• István Kovács, Klavdija Kutnar, János Ruff:
  Rose window graphs underlying rotary maps. 1802-1811
  
• Aleksandar Jurisic, Akihiro Munemasa, Yuki Tagami:
  On graphs with complete multipartite µ-graphs. 1812-1819
  
• Gareth A. Jones, Daniel Pinto:
  Hypermap operations of finite order. 1820-1827
  
• Joohyung Kim:
  A duality between pairs of split decompositions for a Q-polynomial distance-regular graph. 1828-1834
  
• Michael I. Hartley, Gordon I. Williams:
  Representing the sporadic Archimedean polyhedra as abstract polytopes. 1835-1844
  

Volume 310, Numbers 13-14, July 2010

• Jianfeng Wang, Qiongxiang Huang, Francesco Belardo, Enzo Maria Li Marzi:
  On the spectral characterizations of INFINITY -graphs. 1845-1855
  
• Jan Brousek, Premysl Holub:
  The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs. 1856-1863
  
• Shuya Chiba, Masao Tsugaki:
  A degree sum condition for graphs to be covered by two cycles. 1864-1874
  
• Benjamin Kraft, Keenan Monks:
  On conjugacies of the 3x+1 map induced by continuous endomorphisms of the shift dynamical system. 1875-1883
  
• Washiela Fish, Jennifer D. Key, Eric Mwambene:
  Codes from incidence matrices and line graphs of Hamming graphs. 1884-1897
  
• Tomoki Nakamigawa:
  Vertex partition of a complete multipartite graph into two kinds of induced subgraphs. 1898-1911
  
• Daekeun Lim:
  Extremal cliques in Steinhaus graphs. 1912-1917
  
• Fuminiko Nakano, Hirotaka Ono, Taizo Sadahiro:
  Local move connectedness of domino tilings with diagonal impurities. 1918-1931
  
• Manuel Welhan:
  The Hoàng-Reed Conjecture for delta⁺=3. 1932-1939
  
• Dirk Meierling:
  Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three. 1940-1948
  
• Jiangmin Pan, Zhe Liu, Zongwen Yang:
  On 2-arc-transitive representations of the groups of fourth-power-free order. 1949-1955
  
• Dragomir Z. Dokovic:
  On the base sequence conjecture. 1956-1964
  
• Sibel Ozkan, C. A. Rodger:
  Hamilton decompositions of balanced complete multipartite graphs with primitive leaves. 1965-1973
  
• Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel:
  Packing disjoint cycles over vertex cuts. 1974-1978
  
• Luigia Berardi, Mario Gionfriddo, Rosaria Rota:
  Perfect octagon quadrangle systems. 1979-1985
  
• Mario Gionfriddo, Giorgio Ragusa:
  Equitable specialized block-colourings for 4-cycle systems - II. 1986-1994
  
• Xiaomiao Wang, Yanxun Chang:
  Further results on (v, 4, 1)-perfect difference families. 1995-2006
  
• Zhaoping Meng, Lijun Ji, Beiliang Du:
  The existence of augmented resolvable Steiner quadruple systems. 2007-2020
  
• Daniela Amato:
  Descendants in infinite, primitive, highly arc-transitive digraphs. 2021-2036
  
• Laura Beaudin, Joanna A. Ellis-Monaghan, Greta Pangborn, Robert Shrock:
  A little statistical mechanics for the graph theorist. 2037-2053
  
• Xiaoyun Lu:
  A note on 3-connected cubic planar graphs. 2054-2058
  
• Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
  Erratum to "A new upper bound on the queuenumber of hypercubes" [Discrete Mathematics 310 (2010) 935-939]. 2059
  

Volume 310, Numbers 15-16, August 2010

• Ivan N. Landjev, Stoyan Boev:
  Blocking sets of Rédei type in projective Hjelmslev planes. 2061-2068
  
• Jie Ma, Xingxing Yu:
  Bounds for pairs in partitions of graphs. 2069-2081
  
• Longsheng Han, Hong-Jian Lai, Liming Xiong, Huiya Yan:
  The Chvátal-Erdös condition for supereulerian graphs and the Hamiltonian index. 2082-2090
  
• Anush Poghosyan, Vadim E. Zverovich:
  Discrepancy and signed domination in graphs and hypergraphs. 2091-2099
  
• Kenji Kashiwabara, Masataka Nakamura:
  Characterizations of the convex geometries arising from the double shellings of posets. 2100-2112
  
• Min Chen, André Raspaud:
  On acyclic 4-choosability of planar graphs without short cycles. 2113-2118
  
• Landang Yuan, Qingde Kang:
  On overlarge sets of Kirkman triple systems. 2119-2125
  
• Béla Bollobás, Alex D. Scott:
  Max k-cut and judicious k-partitions. 2126-2139
  
• Adriana Hansberg, Lutz Volkmann:
  On the geodetic and geodetic domination numbers of a graph. 2140-2146
  
• Shasha Li, Xueliang Li, Wenli Zhou:
  Sharp bounds for the generalized connectivity kappa₃(G). 2147-2163
  
• Tay-Woei Shyu:
  Decomposition of complete graphs into paths and stars. 2164-2169
  
• Peter Boyvalenkov, Maya Stoyanova:
  A new asymptotic bound of the minimum possible odd cardinality of spherical (2k-1)-designs. 2170-2175
  
• Christopher A. Francisco, Huy Tài Hà, Adam Van Tuyl:
  A conjecture on critical graphs and connections to the persistence of associated primes. 2176-2182
  
• Pavlo Pylyavskyy:
  A₂-web immanants. 2183-2197
  
• Mitchel T. Keller, Stephen J. Young:
  Degree bounds for linear discrepancy of interval orders and disconnected posets. 2198-2203
  
• Kazuhiro Kawamura:
  Independence complexes of chordal graphs. 2204-2211
  
• J. M. McDonald:
  On multiples of simple graphs and Vizing's Theorem. 2212-2214
  
• Lianying Miao, Qingbo Sun:
  On the size of critical graphs with maximum degree 8. 2215-2218
  
• Frédéric Havet, Min-Li Yu:
  Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513]. 2219-2220
  

Volume 310, Numbers 17-18, September 2010

• Erika L. C. King, Michael J. Pelsmajer:
  Dominating sets in plane triangulations. 2221-2230
  
• Wiktor J. Mogilski:
  Polygon vertex extremality and decomposition of polygons. 2231-2237
  
• Mária Zdímalová, Lubica Stanekova:
  Which Faber-Moore-Chen digraphs are Cayley digraphs? 2238-2240
  
• Milica Andelic, Slobodan K. Simic:
  Some notes on the threshold graphs. 2241-2248
  
• Xueliang Li, Jianxi Liu, Lingping Zhong:
  Trees with a given order and matching number that have maximum general Randic index. 2249-2257
  
• Ernst Schuster:
  Group divisible designs with block size four and group type g^um¹ where g is a multiple of 8. 2258-2270
  
• Raiji Mukae, Kenta Ozeki:
  4-connected triangulations and 4-orderedness. 2271-2272
  
• Yingzhi Tian, Jixiang Meng:
  On super restricted edge-connectivity of edge-transitive graphs. 2273-2279
  
• Hasan Coskun:
  Multiple analogues of binomial coefficients and families of related special numbers. 2280-2298
  
• Nancy E. Clarke, Shannon L. Fitzpatrick, A. Hill, Richard J. Nowakowski:
  Edge critical cops and robber. 2299-2309
  
• Keishi Ishii, Kenta Ozeki, Kiyoshi Yoshimoto:
  Set-orderedness as a generalization of k-orderedness and cyclability. 2310-2316
  
• Joseph E. Bonin, Rong Chen, Kai-Nan Xiang:
  Amalgams of extremal matroids with no U_{2, l+2}-minor. 2317-2322
  
• Mingzhi Zhu, Gennian Ge:
  Mixed group divisible designs with three groups and block size 4. 2323-2326
  
• Eric Sopena, Jiaojiao Wu:
  Coloring the square of the Cartesian product of two cycles. 2327-2333
  
• Peter Dankelmann:
  Average distance and generalised packing in graphs. 2334-2344
  
• Yan-Quan Feng, Mohsen Ghasemi, Changqun Wang:
  Cubic semisymmetric graphs of order 6p³. 2345-2355
  
• Khaled M. Elbassioni, Imran Rauf:
  Polynomial-time dualization of r-exact hypergraphs with applications in geometry. 2356-2363
  
• Domenico A. Catalano, Roman Nedela:
  A characterization of regular embeddings of n-dimensional cubes. 2364-2371
  
• Lan Shen, Yingqian Wang:
  Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable. 2372-2379
  
• Lauren Eaton, Steven J. Tedford:
  A branching greedoid for multiply-rooted graphs and digraphs. 2380-2388
  
• Talmage James Reid, Jakayla R. Robbins, Haidong Wu, Xiangqian Zhou:
  Clonal sets in GF(q)-representable matroids. 2389-2397
  
• Anett Boßecker, Dieter Rautenbach:
  Interpolating between bounds on the independence number. 2398-2403
  
• Watcharaphong Ananchuen, Nawarat Ananchuen, Robert E. L. Aldred:
  The structure of 4-gamma-critical graphs with a cut vertex. 2404-2414
  
• James M. Shook, Bing Wei:
  Some properties of k-trees. 2415-2425
  
• Oleg V. Borodin, Min Chen, Anna O. Ivanova, André Raspaud:
  Acyclic 3-choosability of sparse graphs with girth at least 7. 2426-2434
  
• Stephen J. Graves:
  Tessellations with arbitrary growth rates. 2435-2439
  
• Rong Zhang:
  On an identity of Glass and Ng concerning the hook length formula. 2440-2442
  
• Soumyottam Chatterjee, Shamik Ghosh:
  Ferrers dimension and boxicity. 2443-2447
  
• Xueliang Li, Yongtang Shi:
  On a relation between the Randic index and the chromatic number. 2448-2451
  
• Bing Zhou:
  On a construction of graphs with high chromatic capacity and large girth. 2452-2454
  
• Xiaomin Li, Dengxin Li, Hong-Jian Lai:
  On 3-edge-connected supereulerian graphs in graph family C(l, k). 2455-2459
  
• Paul Levande:
  Combinatorial proofs of an identity from Ramanujan's lost notebook and its variations. 2460-2467
  

Volume 310, Number 19, October 2010

• Paola Bandieri, Paola Cristofori, Carlo Gagliardi:
  A census of genus-two 3-manifolds up to 42 coloured tetrahedra. 2469-2481
  
• Ana Paulina Figueroa, Bernardo Llano, Rita Zuazua:
  The number of C₃-free vertices on 3-partite tournaments. 2482-2488
  
• William J. Keith:
  Proof of a conjectured q, t-Schröder identity. 2489-2494
  
• Hortensia Galeana-Sánchez, Ilan A. Goldfeder, Isabel Urrutia:
  On the structure of strong 3-quasi-transitive digraphs. 2495-2498
  
• Xin Zhang, Na Li, Jianliang Wu, Jin Yan:
  Vertex-disjoint triangles in K_{1, t}-free graphs with minimum degree at least t. 2499-2503
  
• Vladimir P. Korzhik:
  Coloring vertices and faces of maps on surfaces. 2504-2509
  
• Seiya Negami, Yusuke Suzuki:
  The 2-extendability of 5-connected graphs on the Klein bottle. 2510-2518
  
• Juanjo Rué:
  Enumeration and limit laws of dissections on a cylinder. 2519-2541
  
• Adrian Dumitrescu, Evan Hilscher:
  On convexification of polygons by pops. 2542-2545
  
• Chris Dowden:
  On the maximum size of minimal definitive quartet sets. 2546-2549
  
• Dejan Brcanov, Vojislav Petrovic:
  Toppling kings in multipartite tournaments by introducing new kings. 2550-2554
  
• Jaromy Kuhl, Brandon Christopher Swan:
  Characterizing paths as m-step competition graphs. 2555-2559
  
• Mindaugas Bloznelis:
  A random intersection digraph: Indegree and outdegree distributions. 2560-2566
  
• Nicolas Lichiardopol:
  Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree. 2567-2570
  

Volume 310, Number 20, October 2010

• Bjarne Toft:
  Preface. 2571-2572
  
• János Barát, Matthias Kriesell:
  What is on his mind? 2573-2583
  
• Oleg V. Borodin, Alexei N. Glebov, André Raspaud:
  Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. 2584-2594
  
• Bojan Mohar:
  Strong embeddings of minimum genus. 2595-2599
  
• Michael D. Barrus, Douglas B. West:
  Degree-associated reconstruction number of graphs. 2600-2612
  
• Baogang Xu, Juan Yan, Xingxing Yu:
  A note on balanced bipartitions. 2613-2617
  
• Robert E. L. Aldred, Michael D. Plummer:
  Distance-restricted matching extension in planar triangulations. 2618-2636
  
• Alexandr V. Kostochka, Noah Prince:
  Dense graphs have K_{3, t} minors. 2637-2654
  
• Ken-ichi Kawarabayashi, Michael D. Plummer:
  A note on traversing specified vertices in graphs embedded with large representativity. 2655-2661
  
• Thomas Böhme, Alexandr V. Kostochka, Andrew Thomason:
  Hadwiger numbers and over-dominating colourings. 2662-2665
  
• Stephan Matos Camacho, Ingo Schiermeyer, Zsolt Tuza:
  Approximation algorithms for the minimum rainbow subgraph problem. 2666-2670
  
• Wolfgang Mader:
  Openly disjoint circuits through a vertex in regular digraphs. 2671-2674
  
• Jørgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts:
  The complexity of colouring by locally semicomplete digraphs. 2675-2684
  
• Gary MacGillivray, Jacobus Swarts:
  The complexity of locally injective homomorphisms. 2685-2696
  
• M. Melcher, K. B. Reid:
  Monochromatic sinks in nearly transitive arc-colored tournaments. 2697-2704
  
• Min Chen, André Raspaud:
  Homomorphisms from sparse graphs to the Petersen graph. 2705-2713
  
• Matthias Kriesell:
  On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs. 2714-2724
  
• Michael O. Albertson, Debra L. Boutin, Ellen Gethner:
  The thickness and chromatic number of r-inflated graphs. 2725-2734
  
• Evelyne Flandrin, Ervin Györi, Hao Li, Jinlong Shu:
  Cyclability in k-connected K_{1, 4}-free graphs. 2735-2741
  
• Herbert Fleischner, Gert Sabidussi, Vladimir I. Sarvanov:
  Maximum independent sets in 3- and 4-regular Hamiltonian graphs. 2742-2749
  
• Reinhard Diestel:
  Locally finite graphs with ends: A topological approach, II. Applications. 2750-2765
  
• Stephan Brandt:
  A note on generalized pentagons. 2766-2767
  

Volume 310, Number 21, November 2010

• Rahul Muthu, N. Narayanan, C. R. Subramanian:
  Optimal acyclic edge colouring of grid like graphs. 2769-2775
  
• R. S. Manikandan, P. Paulraja:
  Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs. 2776-2789
  
• Saihua Liu, Heping Zhang:
  Maximally resonant polygonal systems. 2790-2800
  
• Tran Dinh Luong:
  An upper bound for the k-barycentric Davenport constant of groups of prime order. 2801-2805
  
• Richard Goldstone, Kathryn Weld:
  Graphically abelian groups. 2806-2810
  
• Chai Wah Wu:
  On graphs whose Laplacian matrix's multipartite separability is invariant under graph isomorphism. 2811-2814
  
• Bernd S. W. Schröder:
  Pseudo-similar points in ordered sets. 2815-2823
  
• A. Gerbaud:
  Spectra of generalized compositions of graphs and hierarchical networks. 2824-2830
  
• Aloke Dey:
  Construction of nested orthogonal arrays. 2831-2834
  
• Xi-Ying Yuan, Yan Chen:
  Some results on the spectral radii of bicyclic graphs. 2835-2840
  
• Daniel K. Benvenuti, Abraham P. Punnen:
  SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts. 2841-2846
  
• Michael A. Henning:
  An upper bound on the paired-domination number in terms of the number of edges in the graph. 2847-2857
  
• Jianfeng Wang, Francesco Belardo, QingXiang Huang, Bojana Borovicanin:
  On the two largest Q-eigenvalues of graphs. 2858-2866
  
• Kyohei Kozawa, Yota Otachi, Koichi Yamazaki:
  The carving-width of generalized hypercubes. 2867-2876
  
• Mariusz Grech:
  Regular symmetric groups of boolean functions. 2877-2882
  
• Dwight Duffus, Bill Sands:
  On the size of maximal chains and the number of pairwise disjoint maximal antichains. 2883-2889
  
• David M. Howard, William T. Trotter:
  On the size of maximal antichains and the number of pairwise disjoint maximal chains. 2890-2894
  
• Edward Dobson:
  The isomorphism problem for Cayley ternary relational structures for some abelian groups of order 8p. 2895-2909
  
• Birgit van Dalen:
  The boundary and the shape of binary images. 2910-2918
  
• Vladimir P. Korzhik:
  Exponentially many nonisomorphic genus embeddings of K_{n, m}. 2919-2924
  
• Akihiro Higashitani:
  Shifted symmetric delta-vectors of convex polytopes. 2925-2934
  
• Giuliano G. La Guardia, Reginaldo Palazzo Jr.:
  Constructions of new families of nonbinary CSS codes. 2935-2945
  
• Oleg V. Borodin, Anna O. Ivanova, André Raspaud:
  Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles. 2946-2950
  
• Oleg Pikhurko:
  An analytic approach to stability. 2951-2964
  
• Daniel W. Cranston, Seog-Jin Kim, Gexin Yu:
  Injective colorings of sparse graphs. 2965-2973
  
• Mark Wildon:
  Knights, spies, games and ballot sequences. 2974-2983
  
• Justin Southey, Michael A. Henning:
  On a conjecture on total domination in claw-free cubic graphs. 2984-2999
  
• James G. Lefevre, Mary Waterhouse:
  On defining sets of full designs. 3000-3006
  
• Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi:
  The triangle intersection numbers of a pair of disjoint S(2, 4, v)s. 3007-3017
  
• Youjiang Lin, Gangsong Leng:
  Convex bodies with minimal volume product in R² - a new proof. 3018-3025
  
• Tommy R. Jensen:
  Splits of circuits. 3026-3029
  
• Cui Zhang, Xin Gui Fang:
  A note on the automorphism groups of cubic Cayley graphs of finite simple groups. 3030-3032
  
• Douglas S. Stones:
  The parity of the number of quasigroups. 3033-3039
  
• Wenjie He, Baoli Wang:
  A note on path kernels and partitions. 3040-3042
  
• Nurdin, Edy Tri Baskoro, A. N. M. Salman, N. N. Gaos:
  On the total vertex irregularity strength of trees. 3043-3048
  
• Nathann Cohen, Frédéric Havet:
  Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof. 3049-3051
  
• Olof Heden:
  On kernels of perfect codes. 3052-3055
  

Volume 310, Number 22, November 2010

• Arrigo Bonisoli, Dina Ghinelli, Mario Gionfriddo, Gábor Korchmáros, Guglielmo Lunardon, M. Marchi, S. Pellegrini:
  Preface. 3057
  
• Massimo Giulietti, Gábor Korchmáros:
  On cyclic semi-regular subgroups of certain 2-transitive permutation groups. 3058-3066
  
• Lucia Gionfriddo, Mario Gionfriddo:
  Perfect dodecagon quadrangle systems. 3067-3071
  
• Agnese Ilaria Telloni:
  Combinatorics of a class of groups with cyclic presentation. 3072-3079
  
• Anita Pasotti:
  Constructions for cyclic Moebius ladder systems. 3080-3087
  
• Robert F. Bailey, Brett Stevens:
  Hamiltonian decompositions of complete k-uniform hypergraphs. 3088-3095
  
• Olga Polverino:
  Linear sets in finite projective spaces. 3096-3107
  
• Giuseppe Marino, Rocco Trombetti:
  A new semifield of order 2¹⁰. 3108-3113
  
• Jennifer D. Key, T. P. McDonough, Vassili C. Mavron:
  Reed-Muller codes and permutation decoding. 3114-3119
  
• Stefano Pasotti:
  Regular parallelisms in kinematic spaces. 3120-3125
  
• Lucia Gionfriddo, Mario Gionfriddo, Giorgio Ragusa:
  Equitable specialized block-colourings for 4-cycle systems - I. 3126-3131
  
• Valentina Pepe, Leo Storme, Geertrui Van de Voorde:
  On codewords in the dual code of classical generalised quadrangles and classical polar spaces. 3132-3148
  
• Bart De Bruyn:
  The hyperplanes of DQ^-(7, k) arising from embedding. 3149-3154
  
• Hans-Joachim Kroll, Rita Vincenti:
  A new construction of caps. 3155-3161
  
• Angela Aguglia, Luca Giuzzi, Gábor Korchmáros:
  Constructions of unitals in Desarguesian planes. 3162-3167
  
• Hendrik Van Maldeghem, Valerie Ver Gucht:
  Transitive bislim geometries of gonality 3, Part II: The group theoretic cases. 3168-3181
  
• Simona Bonvicini, Corrado Zanella:
  On generalized null polarities. 3182-3187
  
• György Kiss, Stefano Marcugini, Fernanda Pambianco:
  On the spectrum of the sizes of semiovals in PG(2, q), q odd. 3188-3193
  
• Yanxun Chang, Tao Feng, Giovanni Lo Faro:
  The triangle intersection problem for S(2, 4, v) designs. 3194-3205
  
• Antonio Cossidente, Angelo Sonnino:
  Finite geometry and the Gale transform. 3206-3210
  
• Yulia Kempner, Vadim E. Levit:
  Duality between quasi-concave functions and monotone linkage functions. 3211-3218
  
• Ilaria Cardinali:
  On the grassmann module of symplectic dual polar spaces of rank 4 in characteristic 3. 3219-3227
  
• Joy Morris, Pablo Spiga, Kerri Webb:
  Balanced Cayley graphs and balanced planar graphs. 3228-3235
  
• Massimo Giulietti, Rita Vincenti:
  Three-level secret sharing schemes from the twisted cubic. 3236-3240
  
• A. Kramer, Federico Lastaria, Norma Zagaglia Salvi:
  Perfect matchings of a graph associated with a binary de Bruijn digraph. 3241-3245
  
• Dirk Hachenberger:
  Primitive complete normal bases: Existence in certain 2-power extensions and lower bounds. 3246-3250
  
• Beukje Temmermans, Joseph A. Thas, Hendrik Van Maldeghem:
  Collineations and dualities of partial geometries. 3251-3258
  
• Leif K. Jørgensen:
  Schur rings and non-symmetric association schemes on 64 vertices. 3259-3266
  
• Efraim Laksman, Håkan Lennerstad, Magnus Nilsson:
  Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization. 3267-3275
  
• Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
  On distance two graphs of upper bound graphs. 3276-3277
  
• Koen Struyve, Hendrik Van Maldeghem:
  Affine twin R-buildings. 3278-3286
  

Volume 310, Number 23, December 2010

• Lenny Fukshansky, Daniel Moore, R. Andrew Ohana, Whitney Zeldow:
  On well-rounded sublattices of the hexagonal lattice. 3287-3302
  
• Arielle Leitner, Anant P. Godbole:
  Universal cycles of classes of restricted words. 3303-3309
  
• Gasper Mekis:
  Lower bounds for the domination number and the total domination number of direct product graphs. 3310-3317
  
• Richard P. Anstee, Balin Fleming:
  Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis. 3318-3323
  
• Hannah Alpert:
  Rank numbers of grid graphs. 3324-3333
  
• Zhongyuan Che, Zhibo Chen:
  On k-pairable regular graphs. 3334-3350
  
• Olga Fourtounelli, P. Katerinis:
  The existence of k-factors in squares of graphs. 3351-3358
  
• Luis Boza, Eugenio M. Fedriani, Juan Núñez:
  Outer-embeddability in certain pseudosurfaces arising from three spheres. 3359-3367
  
• Nicolas Lichiardopol:
  A new bound for a particular case of the Caccetta-Häggkvist conjecture. 3368-3372
  
• Michael Freeze, Wolfgang A. Schmid:
  Remarks on a generalization of the Davenport constant. 3373-3389
  
• Xiaoxia Zhang, Mingquan Zhan, Rui Xu, Yehong Shao, Xiangwen Li, Hong-Jian Lai:
  Degree sum condition for Z₃-connectivity in graphs. 3390-3397
  
• Sheshayya A. Choudum, T. Karthick:
  Maximal cliques in {P₂ UNION P₃, C₄}-free graphs. 3398-3403
  
• Chang-Xiang He, Hai-Ying Shan:
  On the Laplacian coefficients of bicyclic graphs. 3404-3412
  
• Joshua D. Laison, Yulan Qing:
  Subspace intersection graphs. 3413-3416
  
• Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
  Long cycles and paths in distance graphs. 3417-3420
  
• Ira M. Gessel, Jang Soo Kim:
  A note on 2-distant noncrossing partitions and weighted Motzkin paths. 3421-3425
  
• Jan Hladký, Daniel Král', Uwe Schauz:
  Brooks' Theorem via the Alon-Tarsi Theorem. 3426-3428
  
• Dingjun Lou:
  Graphs with no M-alternating paths between two vertices: An update. 3429-3431
  
• Noga Alon, Michal Feldman, Ariel D. Procaccia, Moshe Tennenholtz:
  Walking in circles. 3432-3435
  

Volume 310, Number 24, December 2010

• John Gimbel, Jaroslav Nesetril:
  Partitions of graphs into cographs. 3437-3445
  
• Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning:
  Total domination stable graphs upon edge addition. 3446-3454
  
• Guantao Chen, Ralph J. Faudree, Lubomír Soltés:
  Path spectra for trees. 3455-3461
  
• Patrick Bahls, Michael R. Dipasquale:
  Asymptotic connectivity of hyperbolic planar graphs. 3462-3472
  
• Martine Labbé, F. Aykut Özsoy:
  Size-constrained graph partitioning polytopes. 3473-3493
  
• Xiaoling Zhang, Heping Zhang:
  Some results on Laplacian spectral radius of graphs with cut vertices. 3494-3505
  
• Katsuhiro Ota, Takeshi Sugiyama:
  Forbidden subgraphs and the existence of spanning k-trees. 3506-3511
  
• Carolyn Chun, Guoli Ding:
  Unavoidable topological minors of infinite graphs. 3512-3522
  
• Qian Kong, Kaishun Wang:
  On bipartite distance-regular graphs with a strongly closed subgraph of diameter three. 3523-3527
  
• Guoxiang Hu, Wende Chen:
  The weight hierarchies of q-ary linear codes of dimension 4. 3528-3536
  
• Thomas W. Cusick, Yuri L. Borissov:
  A refinement of Cusick-Cheon bound for the second order binary Reed-Muller code. 3537-3543
  
• Cheng Yeaw Ku, Kok Bin Wong:
  Extensions of barrier sets to nonzero roots of the matching polynomial. 3544-3550
  
• Steffen Hitzemann, Winfried Hochstättler:
  On the combinatorics of Galois numbers. 3551-3557
  
• Jizhou Li, Fabrizio Zanello:
  Monomial complete intersections, the weak Lefschetz property and plane partitions. 3558-3570
  
• L'udmila Bezegová, Jaroslav Ivanco:
  An extension of regular supermagic graphs. 3571-3578
  
• H. Li, Vladimir Nikiforov, Richard H. Schelp:
  A new class of Ramsey-Turán problems. 3579-3583
  
• Jean-Christophe Novelli, Jean-Yves Thibon:
  Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions. 3584-3606
  
• Ana Luzón:
  Iterative processes related to Riordan arrays: The reciprocation and the inversion of power series. 3607-3618
  
• Yuanyuan Liu, Qingde Kang:
  Large sets of extended directed triple systems with odd orders. 3619-3632
  
• Hiroaki Taniguchi:
  On d-dimensional Buratti-Del Fra type dual hyperovals in PG(3d, 2). 3633-3645
  
• Christophe Picouleau:
  A note on a conjecture on maximum matching in almost regular graphs. 3646-3647
  
• Haicheng Ma, Haizhen Ren:
  On the spectral characterization of the union of complete multipartite graph and some isolated vertices. 3648-3652
  
• József Balogh, Jane Butterfield:
  Online Ramsey games for triangles in random graphs. 3653-3657
  
• Jin-Xin Zhou, Yan-Quan Feng:
  Semisymmetric elementary abelian covers of the Heawood graph. 3658-3662