Discrete Mathematics, Volume 308

Volume 308, Number 1, January 2008

• Svetoslav Savchev, Fang Chen:
  Long n-zero-free sequences in finite cyclic groups. 1-8
  
• Béla Bollobás, Vladimir Nikiforov:
  Joints in graphs. 9-19
  
• Raffaele Mosca:
  Stable sets of maximum weight in (P₇, banner)-free graphs. 20-33
  
• Kim A. S. Factor, Larry J. Langley:
  Characterization of digraphs with equal domination graphs and underlying graphs. 34-43
  
• Joanna Raczek, Joanna Cyman:
  Total restrained domination numbers of trees. 44-50
  
• Sheng-Liang Yang:
  Some identities involving the binomial sequences. 51-58
  
• Michael Pinsker:
  Monoidal intervals of clones on infinite sets. 59-70
  
• Zhi-Hong Sun:
  Congruences involving Bernoulli polynomials. 71-112
  
• Pei Wang, Xuezheng Lv:
  The codiameter of a 2-connected graph. 113-122
  
• Edy Tri Baskoro, Yus Mochamad Cholily, Mirka Miller:
  Enumerations of vertex orders of almost Moore digraphs with selfrepeats. 123-128
  
• Vladimir Gurvich:
  On cyclically orientable graphs. 129-135
  
• Yufa Shen, Wenjie He, Guoping Zheng, Yanning Wang, Lingmin Zhang:
  On choosability of some complete multipartite graphs and Ohba's conjecture. 136-143
  
• Mohammad Ghebleh, Mahdad Khatirinejad:
  Planarity of iterated line graphs. 144-147
  
• Taíse Santiago Costa Oliveira:
  "Catalan traffic" and integrals on the Grassmannian of lines. 148-152
  

Volume 308, Numbers 2-3, February 2008

• Mario Gionfriddo, Curt Lindner, Guglielmo Lunardon, Alex Rosa:
  Preface. 153
  
• Mario Gionfriddo, Gaetano Quattrocchi:
  Embedding balanced P₃-designs into (balanced) P₄-designs. 155-160
  
• Preben D. Vestergaard:
  A short update on equipackable graphs. 161-165
  
• Reinhard Laue, Alfred Wassermann:
  Simple 8-(31, 12, 3080), 8-(40, 12, 16200) and 8-(40, 12, 16520) designs from PSL(3, 5) and PSL(4, 3). 166-174
  
• Giuseppe Mazzuoccolo:
  Primitive 2-factorizations of the complete graph. 175-179
  
• Sandro Rajola, Maria Scafati Tallini:
  The size of m-irreducible blocking sets and of the sets of class [0, n₁, ..., n_l]. 180-183
  
• Vito Abatangelo, Bambina Larato:
  Complete caps in PG(3, q) with q odd. 184-187
  
• Rita Procesi, Rosaria Rota:
  Complementary multiplicative hyperrings. 188-191
  
• Ian Anderson, Donald A. Preece:
  Some da capo directed power-sequence Z_n+1 terraces with n an odd prime power. 192-206
  
• Alexander Kreuzer, Kay Sörensen:
  Spaces with congruence. 207-213
  
• Charles Curtis Lindner, Alexander Rosa:
  Perfect dexagon triple systems. 214-219
  
• Helmut Karzel, Mario Marchi:
  Introduction of measures for segments and angles in a general absolute plane. 220-230
  
• Lucia Gionfriddo:
  Hexagon quadrangle systems. 231-241
  
• Emanuele Munarini, Claudio Perelli Cippo, Andrea Scagliola, Norma Zagaglia Salvi:
  Double graphs. 242-254
  
• Sveva Freni:
  An equivalence relation in finite planar spaces. 255-266
  
• Irene Sciriha, Patrick W. Fowler:
  On nut and core singular fullerenes. 267-276
  
• Vojislav Petrovic, Miroslav Treml:
  3-Kings in 3-partite tournaments. 277-286
  
• Giuseppa Carrá Ferro, Daniela Ferrarello:
  Ideals and graphs, Gröbner bases and decision procedures in graphs. 287-298
  
• Eva Ferrara Dentice, Giuseppe Marino:
  Classification of Veronesean caps. 299-302
  
• Elizabeth J. Billington, Christopher A. Rodger:
  Resolvable 4-cycle group divisible designs with two associate classes: Part size even. 303-307
  
• Alberto Cavicchioli, Fulvia Spaggiari:
  Graphs encoding 3-manifolds of genus 2. 308-318
  
• Sergei L. Bezrukov, Dalibor Froncek, Steven J. Rosenberg, Petr Kovár:
  On biclique coverings. 319-323
  
• Slobodan K. Simic, Enzo Maria Li Marzi, Francesco Belardo:
  On the index of caterpillars. 324-330
  
• Salvatore Milici:
  Minimum embedding of P₃-designs into TS(v, lambda). 331-338
  
• Leo Storme:
  Weighted {delta(q+1), delta;k-1, q}-minihypers. 339-354
  
• Zoran Radosavljevic, Bojana Mihailovic, Marija Rasajski:
  Decomposition of Smith graphs in maximal reflexive cacti. 355-366
  
• Peter Dukes, Charles J. Colbourn, Violet R. Syrotiuk:
  Directed complete bipartite graph decompositions: Indirect constructions. 367-374
  
• Deirdre Luyckx:
  On maximal partial spreads of H(2n+1, q²). 375-379
  
• Simona Bonvicini:
  Frattini-based starters in 2-groups. 380-381
  
• Selda Küçükçifçi:
  The intersection problem for PBD(5^*, 3)s. 382-385
  
• Peter J. Cameron, Daniele A. Gewurz, Francesca Merola:
  Product action. 386-394
  
• Jan Degraer, Kris Coolsaet:
  Classification of some strongly regular subgraphs of the McLaughlin graph. 395-400
  
• Hans-Joachim Kroll, Rita Vincenti:
  Antiblocking systems and PD-sets. 401-407
  
• Hans-Joachim Kroll, Rita Vincenti:
  PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of PG(5, 2). 408-414
  
• Helmut Karzel, Silvia Pianta:
  Binary operations derived from symmetric permutation sets and applications to absolute geometry. 415-421
  
• Florica Kramer, Horst Kramer:
  A survey on the distance-colouring of graphs. 422-426
  
• Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi:
  Tight blocking sets in some maximum packings of lambdaK_n. 427-438
  
• Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi:
  Determining the spectrum of Meta(K₄+e>K₄, lambda) for any lambda. 439-456
  
• Meinard Müller, Masakazu Jimbo:
  Cyclic sequences of k-subsets with distinct consecutive unions. 457-464
  
• Terry Griggs, Giovanni Lo Faro, Gaetano Quattrocchi:
  On some colouring of 4-cycle systems with specified block colour patterns. 465-478
  

Volume 308, Number 4, February 2008

• Raimundas Vidunas:
  Askey-Wilson relations and Leonard pairs. 479-495
  
• Frédéric Havet, Min-Li Yu:
  (p, 1)-Total labelling of graphs. 496-513
  
• Christian M. Reidys:
  Combinatorics of sequential dynamical systems. 514-528
  
• Markus Kuba, Alois Panholzer:
  On edge-weighted recursive trees and inversions in random permutations. 529-540
  
• Wenchang Chu, Chuanan Wei:
  Legendre inversions and balanced hypergeometric series identities. 541-549
  
• Sheng-Liang Yang:
  An identity of symmetry for the Bernoulli polynomials. 550-554
  
• Hye Kyung Kim, Jaeun Lee:
  A generalized characteristic polynomial of a graph having a semifree action. 555-564
  
• Rumen N. Daskalov:
  On the maximum size of some (k, r)-arcs in PG(2, q). 565-570
  
• Jia Huang, Jun-Ming Xu:
  The bondage numbers and efficient dominations of vertex-transitive graphs. 571-582
  
• Koko Kalambay Kayibi:
  A decomposition theorem for the linking polynomial of two matroids. 583-596
  
• Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
  Contractible edges in minimally k-connected graphs. 597-602
  
• Arash Behzad, Mehdi Behzad, Cheryl E. Praeger:
  On the domination number of the generalized Petersen graphs. 603-610
  
• Hatem M. Bahig:
  On a generalization of addition chains: Addition-multiplication chains. 611-616
  

Volume 308, Numbers 5-6, March 2008

• Keith Edwards:
  Preface. 619
  
• Ian Anderson, Donald A. Preece:
  A general approach to constructing power-sequence terraces for Z_n. 631-644
  
• Anthony J. W. Hilton:
  (r, r+1)-factorizations of (d, d+1)-graphs. 645-669
  
• Peter Dankelmann, Henda C. Swart, Paul van den Berg:
  Diameter and inverse degree. 670-673
  
• Robin W. Whitty:
  Rook polynomials on two-dimensional surfaces and graceful labellings of graphs. 674-683
  
• Ian Anderson, Leigh H. M. Ellison:
  Further results on logarithmic terraces. 684-695
  
• Elizabeth J. Billington, Dean G. Hoffman:
  Equipartite and almost-equipartite gregarious 4-cycle systems. 696-714
  
• Zoran Radosavljevic, Bojana Mihailovic, Marija Rasajski:
  On bicyclic reflexive graphs. 715-725
  
• Arrigo Bonisoli, S. Bonvicini:
  Primitive one-factorizations and the geometry of mixed translations. 726-733
  
• Henning Fernau, Joseph F. Ryan, Kiki A. Sugeng:
  A sum labelling for the generalised friendship graph. 734-740
  
• Nicholas J. Cavenagh, Diane Donovan, Emine Sule Yazici:
  Minimal homogeneous Steiner 2-(v, 3) trades. 741-752
  
• Selda Küçükçifçi, Güven Yücetürk:
  Maximum packing for perfect four-triple configurations. 753-762
  
• Nicolas Lichiardopol:
  Cycles in a tournament with pairwise zero, one or two given vertices in common. 763-771
  
• Charles J. Colbourn:
  Strength two covering arrays: Existence tables and projection. 772-786
  
• Gil Kaplan, Arieh Lev, Yehuda Roditty:
  Bertrand's postulate, the prime number theorem and product anti-magic graphs. 787-794
  
• Janka Rudasová, Roman Sotak:
  Vertex-distinguishing proper edge colourings of some regular graphs. 795-802
  
• Douglas R. Woodall:
  The average degree of an edge-chromatic critical graph. 803-819
  
• Melita Gorse Pihler, Janez Zerovnik:
  Partial cubes are distance graphs. 820-826
  
• Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak:
  General neighbour-distinguishing index of a graph. 827-831
  
• Tatsuya Maruta, Maori Shinohara, Mito Takenaka:
  Constructing linear codes from some orbits of projectivities. 832-841
  
• Mito Takenaka, Kei Okamoto, Tatsuya Maruta:
  On optimal non-projective ternary linear codes. 842-854
  
• Christina M. Mynhardt:
  Trees with depression three. 855-864
  
• Méziane Aïder:
  Bipartite almost distance-hereditary graphs. 865-871
  
• R. Shaw:
  The polynomial degrees of Grassmann and Segre varieties over GF(2). 872-879
  
• Andrei Gagarin, Vadim E. Zverovich:
  A generalised upper bound for the k-tuple domination number. 880-885
  
• Qingde Kang, Hongtao Zhao:
  More large sets of resolvable MTS and resolvable DTS with odd orders. 886-895
  
• Graham A. Case, David A. Pike:
  Pancyclic PBD block-intersection graphs. 896-900
  
• C. A. Baker, Anthony Bonato, Julia M. Nowlin Brown, Tamás Szonyi:
  Graphs with the n-e.c. adjacency property constructed from affine planes. 901-912
  
• Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
  Connectedness of the graph of vertex-colourings. 913-919
  
• Peter J. Cameron, Bill Jackson, Jason D. Rudd:
  Orbit-counting polynomials for graphs and codes. 920-930
  
• Giuseppe Mazzuoccolo:
  On 2-factorizations whose automorphism group acts doubly transitively on the factors. 931-939
  
• Jini Williams, Fred C. Holroyd:
  Semi-total graph colourings, the beta parameter, and total chromatic number. 940-954
  
• Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya:
  A note on chordal bound graphs and posets. 955-961
  
• Andrea C. Burgess, David A. Pike:
  Colouring even cycle systems. 962-973
  
• Elena V. Konstantinova:
  On reconstruction of signed permutations distorted by reversal errors. 974-984
  
• Jianliang Wu, Ping Wang:
  Equitable coloring planar graphs with large girth. 985-990
  
• Abdón Sánchez-Arroyo:
  The Erdos-Faber-Lovász conjecture for dense hypergraphs. 991-992
  
• Vladimir I. Levenshtein:
  A conjecture on the reconstruction of graphs from metric balls of their vertices. 993-998
  

Volume 308, Number 7, April 2008

• Marcel Wild:
  Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid. 999-1017
  
• Alice Hubenko:
  On a cyclic connectivity property of directed graphs. 1018-1024
  
• C. C. Huang, S. S. Yu:
  Prefix-primitivity-preserving homomorphisms. 1025-1032
  
• Ethan Berkove, Jenna Van Sickle, Ben Hummon, Joy Kogut:
  An analysis of the (colored cudes)₃ puzzle. 1033-1045
  
• Vladimir P. Korzhik:
  Exponentially many nonisomorphic orientable triangular embeddings of K_12s. 1046-1071
  
• Vladimir P. Korzhik, Jin Ho Kwak:
  A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs. 1072-1079
  
• Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert, Andrew R. Plummer:
  Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs. 1080-1087
  
• Chia-Fen Chang, Bor-Liang Chen, Hung-Lin Fu:
  Near automorphisms of cycles. 1088-1092
  
• T. L. Alderson, Keith E. Mellinger:
  Classes of optical orthogonal codes from arcs in root subspaces. 1093-1101
  
• R. Julian R. Abel, Esther R. Lamken, Jinhua Wang:
  A few more Kirkman squares and doubly near resolvable BIBDs with block size 3. 1102-1123
  
• Justie Su-tzu Juan, Gerard J. Chang:
  Adaptive group testing for consecutive positives. 1124-1129
  
• David Collins, Tamás Lengyel:
  The game of 3-Euclid. 1130-1136
  
• Nolan McMurray, Talmage James Reid, Laura Sheppardson, Bing Wei, Haidong Wu:
  On deletions of largest bonds in graphs. 1137-1141
  
• Mariusz Grech, Artur Jez, Andrzej Kisielewicz:
  Graphical complexity of products of permutation groups. 1142-1152
  
• Daphne Der-Fen Liu:
  Radio number for trees. 1153-1164
  
• Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steve Horton, Patrick Jones, Grzegorz Kubicki:
  On domination and reinforcement numbers in trees. 1165-1175
  
• Bostjan Bresar, Aleksandra Tepeh Horvat:
  Crossing graphs of fiber-complemented graphs. 1176-1184
  
• Paolo Dulio, Virgilio Pannone:
  Joining caterpillars and stability of the tree center. 1185-1190
  
• Michael Drmota, Th. Stoll:
  Newman's phenomenon for generalized Thue-Morse sequences. 1191-1208
  
• Nancy S. S. Gu, Nelson Y. Li, Toufik Mansour:
  2-Binary trees: Bijections and related issues. 1209-1221
  
• Daniël Paulusma, Kiyoshi Yoshimoto:
  Relative length of longest paths and longest cycles in triangle-free graphs. 1222-1229
  
• Mark S. MacLean, Paul Terwilliger:
  The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two. 1230-1259
  
• Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer:
  Matching properties in connected domination critical graphs. 1260-1267
  
• Mirko Hornák, Mariusz Wozniak:
  On arbitrarily vertex decomposable trees. 1268-1281
  
• Toru Kojima:
  Bandwidth of the strong product of two connected graphs. 1282-1295
  
• Yaojun Chen, T. C. Edwin Cheng, C. T. Ng:
  Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5. 1296-1307
  
• C. M. da Fonseca, E. Marques De Sá:
  Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope. 1308-1318
  
• Vladimir P. Korzhik:
  Minimal non-1-planar graphs. 1319-1327
  
• Young-Ming Chen:
  The Chung-Feller theorem revisited. 1328-1329
  
• Cheng-Kuan Lin, Hua-Min Huang, Jimmy J. M. Tan, Lih-Hsing Hsu:
  On spanning connected graphs. 1330-1333
  
• Xueliang Li, Jianhua Tu:
  NP-completeness of 4-incidence colorability of semi-cubic graphs. 1334-1340
  
• Rumen N. Daskalov:
  A geometric construction of a (38, 2)-blocking set in PG(2, 13) and the related [145, 3, 133]₁₃ code. 1341-1345
  

Volume 308, Number 8, April 2008

• Stefan Felsner, Marco E. Lübbecke, Jarik Nesetril:
  Preface. 1347-1349
  
• Jun Tarui:
  On the minimum number of completely 3-scrambling permutations. 1350-1354
  
• Javier Barajas, Oriol Serra:
  Distance graphs with maximum chromatic number. 1355-1365
  
• Francisco Javier Zaragoza Martínez:
  Series-parallel graphs are windy postman perfect. 1366-1374
  
• Noga Alon, Jaroslaw Grytczuk:
  Breaking the rhythm on graphs. 1375-1380
  
• Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
  Representing edge intersection graphs of paths on degree 4 trees. 1381-1387
  
• Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead:
  The game of arboricity. 1388-1393
  
• Márton Makai:
  Matroid matching with Dilworth truncation. 1394-1404
  
• D. Gonçalves:
  On the L(p, 1)-labelling of graphs. 1405-1414
  
• Peter Frankl, Gyula Y. Katona:
  Extremal k-edge-hamiltonian hypergraphs. 1415-1424
  
• Audrey Lee, Ileana Streinu:
  Pebble game algorithms and sparse graphs. 1425-1437
  
• Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni:
  Improper colouring of (random) unit disk graphs. 1438-1454
  
• Gordana Manic, Yoshiko Wakabayashi:
  Packing triangles in low degree graphs and indifference graphs. 1455-1471
  
• Gyula Pap:
  Packing non-returning A-paths algorithmically. 1472-1488
  

Volume 308, Number 9, May 2008

• Sapna Jain:
  CT bursts - from classical to array coding. 1489-1499
  
• Sergey V. Avgustinovich, Sergey Kitaev:
  On uniquely k-determined permutations. 1500-1507
  
• Maurice Queyranne, Fabio Tardella:
  Sublattices of product spaces: Hulls, representations and counting. 1508-1523
  
• Vincent Vatter:
  Reconstructing compositions. 1524-1530
  
• Norbert Seifter:
  Transitive digraphs with more than one end. 1531-1537
  
• Guy Louchard, Helmut Prodinger:
  On gaps and unoccupied urns in sequences of geometrically distributed random variables. 1538-1562
  
• Emlee W. Nicholson, Bing Wei:
  Long cycles containing k-ordered vertices in graphs. 1563-1570
  
• Jill R. Faudree, Ralph J. Faudree, Zdenek Ryjácek:
  Forbidden subgraphs that imply 2-factors. 1571-1582
  
• V. Linek, N. Shalaby:
  The existence of (p, q)-extended Rosa sequences. 1583-1602
  
• Ruihu Li, Xueliang Li:
  Binary construction of quantum codes of minimum distances five and six. 1603-1611
  
• Jun Fujisawa, Tomoki Yamashita:
  Degree conditions on claws and modified claws for hamiltonicity of graphs. 1612-1619
  
• Tomoki Yamashita:
  Degree sum and connectivity conditions for dominating cycles. 1620-1627
  
• Shinya Fujita:
  Vertex-disjoint copies of K₁+(K₁ v K₂) in claw-free graphs. 1628-1633
  
• Yuanqiu Huang, Tinglei Zhao:
  The crossing number of K_{1, 4, n}. 1634-1638
  
• Tomás Feder, Pavol Hell:
  On realizations of point determining graphs, and obstructions to full homomorphisms. 1639-1652
  
• Gustav Nordh:
  Perfect Skolem sets. 1653-1664
  
• Jian Wang, Beiliang Du:
  P₅-factorization of complete bipartite graphs. 1665-1673
  
• M. Hachimori, M. Nakamura:
  The max-flow min-cut property of two-dimensional affine convex geometries. 1674-1689
  
• Martin W. Bunder, Keith P. Tognetti, Glen E. Wheeler:
  On binary reflected Gray codes and functions. 1690-1700
  
• Seul Hee Choi:
  The Robinson-Schensted correspondence for skew oscillating semi-standard tableaux. 1701-1709
  
• Lutz Volkmann, Stefan Winzen:
  Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5. 1710-1721
  
• Béla Bollobás, András Gyárfás:
  Highly connected monochromatic subgraphs. 1722-1725
  
• Liqiong Xu, Xiaofeng Guo:
  Removable edges in a 5-connected graph and a construction method of 5-connected graphs. 1726-1731
  
• Geetika Narang, A. K. Agarwal:
  Lattice paths and n-colour compositions. 1732-1740
  
• Guizhen Liu, Lanju Zhang:
  Toughness and the existence of fractional k-factors of graphs. 1741-1748
  
• Artem V. Pyatkin:
  Subdivided trees are integral sum graphs. 1749-1750
  
• Daqing Yang, Hal A. Kierstead:
  Asymmetric marking games on line graphs. 1751-1755
  
• Victor J. W. Guo:
  Bijective proofs of Gould's and Rothe's identities. 1756-1759
  
• Pablo Spiga, Qiang Wang:
  An answer to Hirasaka and Muzychuk: Every p-Schur ring over C^p_p is Schurian. 1760-1763
  

Volume 308, Number 10, May 2008

• Marek Niezgoda:
  Remarks on convex functions and separable sequences. 1765-1773
  
• Josef Niederle:
  Forbidden retracts for finite ordered sets of width at most four. 1774-1784
  
• Mostafa Blidia, Mustapha Chellali, Frédéric Maffray:
  Extremal perfect graphs for a bound on the domination number. 1785-1791
  
• Rafael R. Kamalian, Vahan V. Mkrtchyan:
  On complexity of special maximum matchings constructing. 1792-1800
  
• Stephen W. Hruska:
  On tree congestion of graphs. 1801-1809
  
• Marien Abreu, Martin Funk, Domenico Labbate, Vito Napolitano:
  A family of regular graphs of girth 5. 1810-1815
  
• Daniel C. Slilaty, Hongxun Qin:
  The signed-graphic representations of wheels and whirls. 1816-1825
  
• Ronald C. Read, Earl Glen Whitehead Jr.:
  A note on chain lengths and the Tutte polynomial. 1826-1829
  
• Haicheng Ma, Haizhen Ren:
  The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than -4. 1830-1836
  
• Weidong Chen, Enmin Song:
  Lower bounds on several versions of signed domination number. 1837-1846
  
• Andrej Vodopivec:
  On embeddings of snarks in the torus. 1847-1849
  
• Junling Zhou, Yanxun Chang, L. Ji:
  The spectrum for large sets of pure Mendelsohn triple systems. 1850-1863
  
• Matías Menni:
  Combinatorial functional and differential equations applied to differential posets. 1864-1888
  
• Stephen J. Curran:
  Further results on the enumeration of hamilton paths in Cayley digraphs on semidirect products of cyclic groups. 1889-1908
  
• Michael A. Henning, Jacob Elgin Maritz:
  Total restrained domination in graphs with minimum degree two. 1909-1920
  
• Jun Guo, Suogang Gao:
  Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs. 1921-1929
  
• Feng Ming Dong, Khee Meng Koh:
  Domination numbers and zeros of chromatic polynomials. 1930-1940
  
• Bernardo Gabriel Rodrigues:
  Self-orthogonal designs and codes from the symplectic groups S₄(3) and S₄(4). 1941-1950
  
• Henry Escuadro, Ping Zhang:
  Extremal problems on detectable colorings of trees. 1951-1961
  
• Gábor N. Sárközy:
  On 2-factors with k components. 1962-1972
  
• Severino V. Gervacio, Yvette F. Lim, Hiroshi Maehara:
  Planar unit-distance graphs having planar unit-distance complement. 1973-1984
  
• Camino Balbuena, Pedro García-Vázquez, Xavier Marcote:
  Connectivity measures in matched sum graphs. 1985-1993
  
• Daniel C. Slilaty, Hongxun Qin:
  Connectivity in frame matroids. 1994-2001
  
• Kia Dalili, Sara Faridi, Will Traves:
  The reconstruction conjecture and edge ideals. 2002-2010
  
• Michael Cavers, Jacques Verstraëte:
  Clique partitions of complements of forests and bounded degree graphs. 2011-2017
  
• Binod Kumar Sahoo:
  New constructions of two slim dense near hexagons. 2018-2024
  
• Mohamed El-Zahar, Sylvain Gravier, Antoaneta Klobucar:
  On the total domination number of cross products of graphs. 2025-2029
  
• W. D. Gao, R. Thangadurai, J. Zhuang:
  Addition theorems on the cyclic groups of order p^l. 2030-2033
  
• C. E. Priebe, Walter D. Wallis:
  On the anomalous behaviour of a class of locality statistics. 2034-2037
  
• Minghui Jiang:
  On the sum of distances along a circle. 2038-2045
  
• Hasmawati, Edy Tri Baskoro, H. Assiyatun:
  The Ramsey numbers for disjoint unions of graphs. 2046-2049
  
• Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
  Counting nowhere-zero flows on wheels. 2050-2053
  
• Branimir Seselja, Andreja Tepavcevic:
  A note on atomistic weak congruence lattices. 2054-2057
  

Volume 308, Number 11, June 2008

• James G. Lefevre:
  The volume and foundation of star trades. 2059-2066
  
• Sergei L. Bezrukov, Miquel Rius, Oriol Serra:
  The vertex isoperimetric problem for the powers of the diamond graph. 2067-2074
  
• Bo-Jr Li, Gerard J. Chang:
  Clique coverings and partitions of line graphs. 2075-2079
  
• Alexander W. Dent:
  Point-weight designs with design conditions on t points. 2080-2093
  
• Dingjun Lou, Wei Wang:
  Characterization of graphs with infinite cyclic edge connectivity. 2094-2103
  
• Víctor Dalmau, Andrei A. Krokhin, Benoit Larose:
  Retractions onto series-parallel posets. 2104-2114
  
• Dirk Meierling, Lutz Volkmann:
  All 2-connected in-tournaments that are cycle complementary. 2115-2133
  
• Jack Huizenga:
  Chromatic capacity and graph operations. 2134-2148
  
• Karola Mészáros:
  On 3-regular 4-ordered graphs. 2149-2155
  
• Jin Ho Kwak, Young Soo Kwon:
  Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphs. 2156-2166
  
• Néstor E. Aguilera, Valeria A. Leoni:
  Characterizations of postman sets. 2167-2174
  
• Ardeshir Dolati, S. Mehdi Hashemi:
  On the sphericity testing of single source digraphs. 2175-2181
  
• Tomislav Doslic, Darko Veljan:
  Logarithmic behavior of some combinatorial sequences. 2182-2212
  
• Yongxi Cheng, Xiaoming Sun, Yiqun Lisa Yin:
  Searching monotone multi-dimensional arrays. 2213-2221
  
• William Y. C. Chen, Eva Yu-Ping Deng, Laura L. M. Yang:
  Riordan paths and derangements. 2222-2227
  
• Italo Simonelli:
  Optimal graphs for chromatic polynomials. 2228-2239
  
• Michael J. Fisher, Garth Isaak:
  Distinguishing colorings of Cartesian products of complete graphs. 2240-2246
  
• Ákos Kisvölcsey:
  Weighted cross-intersecting families. 2247-2260
  
• Jean-Pierre Duval, Tero Harju, Dirk Nowotka:
  Unbordered factors and Lyndon words. 2261-2264
  
• David Défossez:
  A sufficient condition for the bicolorability of a hypergraph. 2265-2268
  
• Dingjun Lou:
  Characterizing minimally n-extendable bipartite graphs. 2269-2272
  
• Yasuhiro Nakashima:
  The transitivity of Conway's M₁₃. 2273-2276
  
• Adriana Hansberg, Lutz Volkmann:
  On graphs with equal domination and 2-domination numbers. 2277-2281
  
• MingChu Li, Liming Xiong, H. J. Broersma:
  Connected even factors in claw-free graphs. 2282-2284
  
• Feng Ming Dong, Khee Meng Koh:
  A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. 2285-2287
  
• G. Ayik, H. Ayik, Y. Ünlü:
  On semigroup presentations and Adian graphs. 2288-2291
  
• Wang Chao, Zhou Guofei:
  Note on the degree sequences of k-hypertournaments. 2292-2296
  
• Tomislav Doslic:
  Counting perfect matchings in n-extendable graphs. 2297-2300
  
• Melody Chan, Anant P. Godbole:
  Improved pebbling bounds. 2301-2306
  
• Masahiro Hachimori:
  Decompositions of two-dimensional simplicial complexes. 2307-2312
  
• Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo:
  On matching and total domination in graphs. 2313-2318
  
• Nadia Brauner, Vincent Jost:
  Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture. 2319-2324
  
• Dieter Rautenbach:
  A note on domination, girth and minimum degree. 2325-2329
  
• Melody Chan:
  The distinguishing number of the augmented cube and hypercube powers. 2330-2336
  
• Minh Hoang Nguyen, Mirka Miller:
  Structural properties of graphs of diameter 2 with maximal repeats. 2337-2341
  

Volume 308, Number 12, June 2008

• Evelyne Flandrin, Tomás Kaiser, Roman Kuzel, Hao Li, Zdenek Ryjácek:
  Neighborhood unions and extremal spanning trees. 2343-2350
  
• Zsolt Patakfalvi:
  Line-graphs of cubic graphs are normal. 2351-2365
  
• Karola Mészáros:
  Generalized Latin squares and their defining sets. 2366-2378
  
• Masahiro Hachimori, Sonoko Moriyama:
  A note on shellability and acyclic orientations. 2379-2381
  
• Jun Fujisawa, Tomoki Yamashita:
  A degree sum condition for long cycles passing through a linear forest. 2382-2388
  
• Yota Otachi, Koichi Yamazaki:
  A lower bound for the vertex boundary-width of complete k-ary trees. 2389-2395
  
• Keith Edwards, Graham Farr:
  Planarization and fragmentability of some classes of graphs. 2396-2406
  
• Adam Nadolski:
  Compact cyclic edge-colorings of graphs. 2407-2417
  
• Karola Mészáros:
  On low degree k-ordered graphs. 2418-2426
  
• Zhongyuan Che, Zhibo Chen:
  Forcing faces in plane bipartite graphs. 2427-2439
  
• Heather Jordon, Joy Morris:
  Cyclic hamiltonian cycle systems of the complete graph minus a 1-factor. 2440-2449
  
• Miloud Mihoubi:
  Bell polynomials and binomial type sequences. 2450-2459
  
• Hortensia Galeana-Sánchez, Ricardo Gómez:
  Independent sets and non-augmentable paths in generalizations of tournaments. 2460-2472
  
• Joanna Raczek:
  Distance paired domination numbers of graphs. 2473-2483
  
• Gabriela Araujo-Pardo, Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
  On the order of ({r, m};g)-cages of even girth. 2484-2491
  
• Augustine O. Munagi:
  Pairing conjugate partitions by residue classes. 2492-2501
  
• Sven Hartmann, Uwe Leck, Volker Leck:
  More orthogonal double covers of complete graphs by Hamiltonian paths. 2502-2508
  
• Anthony Mendes, Jeffrey B. Remmel:
  Descents, inversions, and major indices in permutation groups. 2509-2524
  
• Sr. Arworn, Ulrich Knauer, S. Leeratanavalee:
  Locally strong endomorphisms of paths. 2525-2532
  
• Zeev Nutov:
  On extremal k-outconnected graphs. 2533-2543
  
• Martin Aigner:
  Enumeration via ballot numbers. 2544-2563
  
• B. P. Tan:
  On semicomplete multipartite digraphs whose king sets are semicomplete digraphs. 2564-2570
  
• Atsuhiro Nakamoto:
  5-Chromatic even triangulations on surfaces. 2571-2580
  
• R. Sritharan:
  Chordal bipartite completion of colored graphs. 2581-2588
  
• John L. Goldwasser, William Klostermeyer:
  Tight bounds for eternal dominating sets in graphs. 2589-2593
  
• Kiyoshi Yoshimoto:
  Edge degrees and dominating cycles. 2594-2599
  
• Iwao Sato:
  Weighted Bartholdi zeta functions of graph coverings. 2600-2606
  
• R. Balakrishnan, S. Francis Raj:
  Connectivity of the Mycielskian of a graph. 2607-2610
  
• Amy M. Fu:
  A combinatorial proof of the Lebesgue identity. 2611-2613
  
• Min Tang:
  Partitions of the set of natural numbers and their representation functions. 2614-2616
  
• Miwako Mishima:
  The spectrum of 1-rotational Steiner triple systems over a dicyclic group. 2617-2619
  
• András Gyárfás, Gábor N. Sárközy:
  Size of monochromatic components in local edge colorings. 2620-2622
  
• John S. Caughman IV, Clifford R. Haithcock, J. J. P. Veerman:
  A note on lattice chains and Delannoy numbers. 2623-2628
  
• An-Hang Chen, Jou-Ming Chang, Yuwen Cheng, Yue-Li Wang:
  The existence and uniqueness of strong kings in tournaments. 2629-2633
  
• Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
  Hamiltonian connected hourglass free line graphs. 2634-2636
  
• Jiaojiao Wu, Xuding Zhu:
  Lower bounds for the game colouring number of partial k-trees and planar graphs. 2637-2642
  
• Hongming Yan, Suohai Fan:
  Weakly s-arc transitive graphs. 2643-2646
  
• András Frank, Lap Chi Lau, Jácint Szabó:
  A note on degree-constrained subgraphs. 2647-2648
  
• Eli Berger, Ran Ziv:
  A note on the edge cover number and independence number in hypergraphs. 2649-2654
  

Volume 308, Number 13, July 2008

• Warwick de Launey:
  Combinatorial Designs: A tribute to Jennifer Seberry on her 60th Birthday. 2655-2656
  
• Spencer P. Hurd, Dinesh G. Sarvate:
  On c-Bhaskar Rao Designs and tight embeddings for path designs. 2659-2662
  
• Spencer P. Hurd, Dinesh G. Sarvate:
  Group divisible designs with block size four and two groups. 2663-2673
  
• Gennian Ge, Malcolm Greig, Alan C. H. Ling, Rolf S. Rees:
  Resolvable balanced incomplete block designs with subdesigns of block size 4. 2674-2703
  
• Gennian Ge:
  Construction of optimal ternary constant weight codes via Bhaskar Rao designs. 2704-2708
  
• Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling:
  Constructing strength three covering arrays with augmented annealing. 2709-2722
  
• Christos Koukouvinos, S. Stylianou:
  On skew-Hadamard matrices. 2723-2731
  
• Petteri Kaski, Patric R. J. Östergård, Svetlana Topalova, Rosen Zlatarski:
  Steiner triple systems of order 19 and 21 with subsystems of order 7. 2732-2741
  
• Vassili C. Mavron, T. P. McDonough, Vladimir D. Tonchev:
  On affine designs and Hadamard designs with line spreads. 2742-2750
  
• Nicholas C. Wormald, Sanming Zhou:
  Large forbidden trade volumes and edge packings of random graphs. 2751-2755
  
• Jim A. MacDougall, Walter D. Wallis:
  Strong edge-magic graphs of maximum size. 2756-2763
  
• Yu Qing Chen, Kathy J. Horadam, Wei-Hung Liu:
  Relative difference sets fixed by inversion (III) - Cocycle theoretical approach. 2764-2775
  
• Yutaka Hiramine, Noboru Ito:
  On left Hadamard transversals in non-solvable groups. 2776-2780
  
• Deborah J. Street, Leonie Burgess:
  Some open combinatorial problems in the design of stated choice experiments. 2781-2788
  
• Rudolf Mathon, Anne Penfold Street, Greg Gamble:
  Classification of partitions of all triples on ten points into copies of Fano and affine planes. 2789-2795
  
• Wolf H. Holzmann, Hadi Kharaghani, Behruz Tayfeh-Rezaie:
  All triples for orthogonal designs of order 40. 2796-2801
  
• Miin Huey Ang, K. T. Arasu, Siu Lun Ma, Yoseph Strassler:
  Study of proper circulant weighing matrices with weight 9. 2802-2809
  
• Mirka Miller, Rinovia Simanjuntak:
  Graphs of order two less than the Moore bound. 2810-2821
  
• Hung-Lin Fu, S. L. Logan, Christopher A. Rodger:
  Maximal sets of hamilton cycles in K_2p-F. 2822-2829
  
• Nicholas J. Cavenagh, Diane Donovan, Abdollah Khodkar, G. H. John Van Rees:
  When is a partial Latin square uniquely completable, but not its completable product? 2830-2843
  
• Elizabeth J. Billington, Dean G. Hoffman, Christopher A. Rodger:
  Resolvable gregarious cycle decompositions of complete equipartite graphs. 2844-2853
  
• Alexander Pott:
  Two applications of relative difference sets: Difference triangles and negaperiodic autocorrelation functions. 2854-2861
  
• Jennifer D. Key, P. Seneviratne:
  Permutation decoding for binary codes from lattice graphs. 2862-2867
  
• Robert Craigen, R. Woodford:
  Power Hadamard matrices. 2868-2884
  
• Alphonse Baartmans, Sharad S. Sane:
  Blocker sets, orthogonal arrays and their application to combination locks. 2885-2895
  
• Abdollah Khodkar, Warwick de Launey:
  On the range of influences in back-circulant Latin squares. 2896-2900
  
• Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, Todd Smith:
  All graphs with maximum degree three whose complements have 4-cycle decompositions. 2901-2909
  
• Warwick de Launey, Richard M. Stafford:
  On the automorphisms of Paley's type II Hadamard matrix. 2910-2924
  

Volume 308, Number 14, July 2008

• Sejeong Bang, Hyun Kwang Kim, Jack H. Koolen, Mitsugu Hirasaka, Sung Yell Song:
  Preface. 2925
  
• Anna Draganova, Yukiyasu Mutoh, Richard M. Wilson:
  More on decompositions of edge-colored complete graphs. 2926-2943
  
• Tatsuya Fujisaki:
  A construction of non-isomorphic amorphous association schemes from pseudo-cyclic association schemes. 2944-2948
  
• A. Rahnamai Barghi:
  Common properties of table algebras and association schemes. 2949-2958
  
• Yukiyasu Mutoh, Vladimir D. Tonchev:
  Difference systems of sets and cyclotomy. 2959-2969
  
• Akihide Hanaki:
  Clifford theory for commutative association schemes. 2970-2975
  
• A. De Wispelaere, Hendrik Van Maldeghem:
  Some new two-character sets in PG(5, q²) and a distance-2 ovoid in the generalized hexagon H(4). 2976-2983
  
• Jose Maria P. Balmaceda, Rowena Alma L. Bettyand, Fidel R. Nemenzo:
  Mass formula for self-dual codes over Z_p². 2984-3002
  
• Brian Curtin:
  Inheritance of hyper-duality in imprimitive Bose-Mesner algebras. 3003-3017
  
• Koichi Betsumiya:
  Minimum Lee weights of Type II codes over I. 3018-3022
  
• Rongquan Feng, Yangxian Wang, Changli Ma, Jianmin Ma:
  Eigenvalues of association schemes of quadratic forms. 3023-3047
  
• Masashi Shinohara:
  Uniqueness of maximum planar five-distance sets. 3048-3055
  
• John S. Caughman IV, Elizabeth J. Hart, Jianmin Ma:
  The last subconstituent of the Hemmeter graph. 3056-3060
  
• Weixia Li, Hao Shen:
  Simple 3-designs of PSL(2, 2ⁿ) with block size 6. 3061-3072
  
• Izumi Miyamoto:
  A combinatorial approach to doubly transitive permutation groups. 3073-3081
  
• E. J. Cheon, T. Kato, S. J. Kim:
  Nonexistence of a [g_q(5, d), 5, d]_q code for 3q⁴-4q³-2q+1<=d<=3q⁴-4q³-q. 3082-3089
  
• Arlene A. Pascasio:
  A characterization of Q-polynomial distance-regular graphs. 3090-3096
  
• Mikhail E. Muzychuk, Paul-Hermann Zieschang:
  On association schemes all elements of which have valency 1 or 2. 3097-3103
  
• Denis S. Krotov:
  On diameter perfect constant-weight ternary codes. 3104-3114
  
• Jon-Lark Kim, Judy Walker:
  Nonbinary quantum error-correcting codes from algebraic curves. 3115-3124
  

Volume 308, Number 15, August 2008

• W. M. B. Dukes, Toufik Mansour, Astrid Reifegerste:
  Wilf classification of three and four letter signed patterns. 3125-3133
  
• Baogang Xu:
  On minimally circular-imperfect graphs. 3134-3142
  
• Xiao-Dong Zhang:
  The Laplacian spectral radii of trees with degree sequences. 3143-3150
  
• Miki Hermann:
  On Boolean primitive positive clones. 3151-3162
  
• Wenchang Chu, Chuanan Wei:
  Set partitions with restrictions. 3163-3168
  
• Christopher Carl Heckman:
  On the tightness of the I independence ratio. 3169-3179
  
• Kinkar Chandra Das, R. B. Bapat:
  A sharp upper bound on the spectral radius of weighted graphs. 3180-3186
  
• F. Dahme, Dieter Rautenbach, Lutz Volkmann:
  alpha-Domination perfect trees. 3187-3198
  
• Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
  Equivariant collapses and the homotopy type of iterated clique graphs. 3199-3207
  
• Vladimir P. Korzhik, Jin Ho Kwak:
  Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness. 3208-3212
  
• Odile Favaron, Michael A. Henning:
  Total domination in claw-free graphs with minimum degree 2. 3213-3219
  
• Denis Chebikin:
  Graph powers and k-ordered Hamiltonicity. 3220-3229
  
• Michael S. Cavers, Randall J. Elzinga, David A. Gregory, Sarah E. Vanderlinde, Kevin N. Vander Meulen:
  Clique partitions of distance multigraphs. 3230-3240
  
• Zhao Chengye, Yang Yuansheng, Sun Linlin:
  Domination dot-critical graphs with no critical vertices. 3241-3248
  
• Yuqing Lin, Camino Balbuena, Xavier Marcote, Mirka Miller:
  On the connectivity of (k, g)-cages of even girth. 3249-3256
  
• Yutaka Hiramine, Chihiro Suetake:
  A contraction of square transversal designs. 3257-3264
  
• Angelika Hellwig, Lutz Volkmann:
  Maximally edge-connected and vertex-connected graphs and digraphs: A survey. 3265-3296
  
• Andrzej Czygrinow, Glenn H. Hurlbert:
  On the pebbling threshold of paths and the pebbling threshold spectrum. 3297-3307
  
• Eric Sundberg:
  Economical tight examples for the biased Erdös-Selfridge theorem. 3308-3314
  
• Oscar Ordaz, Domingo Quiroz:
  Representation of group elements as subsequence sums. 3315-3321
  
• Denis S. Krotov:
  On decomposability of 4-ary distance 2 MDS codes, double-codes, and n-quasigroups of order 4. 3322-3334
  
• R. Julian R. Abel, Ahmed M. Assaf:
  Modified group divisible designs with block size 5 and even index. 3335-3351
  
• Teresa Sousa:
  Friendship decompositions of graphs. 3352-3360
  
• J. Gómez:
  Two new methods to obtain super vertex-magic total labelings of graphs. 3361-3372
  
• Erfang Shan, T. C. Edwin Cheng:
  Remarks on the minus (signed) total domination in graphs. 3373-3380
  
• Nick C. Fiala:
  Shortest single axioms for commutative moufang loops of exponent 3. 3381-3385
  
• Shexi Chen, Bolian Liu:
  Matrices with maximum kth local exponent in the class of doubly symmetric primitive matrices. 3386-3392
  
• Guoce Xin:
  Constructing all magic squares of order three. 3393-3398
  
• Pawel Pralat:
  The diameter of protean graphs. 3399-3406
  
• Hua Wang:
  Extremal trees with given degree sequence for the Randic index. 3407-3411
  
• Frédéric Havet, Stéphan Thomassé, Anders Yeo:
  Hoàng-Reed conjecture holds for tournaments. 3412-3415
  
• Huajun Tang, Yaojun Chen:
  Upper signed domination number. 3416-3419
  
• Xinmin Hou:
  A characterization of (2gamma, gamma_p)-trees. 3420-3426
  

Volume 308, Number 16, August 2008

• Tian-Xiao He, Leetsch C. Hsu, Peter Jau-Shyong Shiue:
  A symbolic operator approach to several summation formulas for power series II. 3427-3440
  
• Juan José Montellano-Ballesteros, Victor Neumann-Lara, Eduardo Rivera-Campo:
  On a heterochromatic number for hypercubes. 3441-3448
  
• Kiyoshi Ando, Yoshimi Egawa:
  Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph. 3449-3460
  
• Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
  Contractibility and the clique graph operator. 3461-3469
  
• Immanuel Halupczok, Jan-Christoph Schlage-Puchta:
  Some strategies for higher dimensional animal achievement games. 3470-3478
  
• Matthew Elder:
  Path bundles on n-cubes. 3479-3490
  
• Odile Favaron, Michael A. Henning:
  Bounds on total domination in claw-free cubic graphs. 3491-3507
  
• Joaquim Borges, Josep Rifà, Victor A. Zinoviev:
  On non-antipodal binary completely regular codes. 3508-3525
  
• Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote:
  Diameter-girth sufficient conditions for optimal extraconnectivity in graphs. 3526-3536
  
• Irina Cristea, Mirela Stefanescu:
  Binary relations and reduced hypergroups. 3537-3544
  
• Julie Haviland:
  Independent domination in triangle-free graphs. 3545-3550
  
• Gus Wiseman:
  Set maps, umbral calculus, and the chromatic polynomial. 3551-3564
  
• Wensong Lin:
  Multicoloring and Mycielski construction. 3565-3573
  
• Ilda P. F. da Silva:
  Cubes and orientability. 3574-3585
  
• R. S. Manikandan, P. Paulraja:
  Hamilton cycle decompositions of the tensor product of complete multipartite graphs. 3586-3606
  
• Jianfeng Wang, Ruying Liu, Chengfu Ye, Qiongxiang Huang:
  A complete solution to the chromatic equivalence class of graph I. 3607-3623
  
• Tao-Ming Wang, Cheng-Chih Hsiao:
  On anti-magic labeling for graph products. 3624-3633