Discrete Mathematics, Volume 306

Volume 306, Number 1, 28 January 2006

Contributions

• 
  Sukumar Das Adhikari, Yong-Gao Chen, John B. Friedlander, Sergei Konyagin, Francesco Pappalardi:
  Contributions to zero-sum problems. 1-10
• 
  Tamara Burton, David P. Sumner:
  Domination dot-critical graphs. 11-18
• 
  Zhibo Chen:
  On integral sum graphs. 19-25
• 
  Matt DeVos, Rui Xu, Gexin Yu:
  Nowhere-zero Z₃-flows through Z₃-connectivity. 26-30
• 
  Melodie Fehr, Shonda Gosselin, Ortrud R. Oellermann:
  The metric dimension of Cayley digraphs. 31-41
• 
  John C. Galati:
  A group extensions approach to affine relative difference sets of even order. 42-51
• 
  Gennian Ge:
  Resolvable group divisible designs with block size four and index three. 52-65
• 
  Seth Kleinerman:
  Bounds on the forcing numbers of bipartite graphs. 66-73
• 
  Cheng Yeaw Ku, Imre Leader:
  An Erd˝s-Ko-Rado theorem for partial permutations. 74-86
• 
  Weiqi Luo, Zhi-Hong Chen, Wei-Guo Chen:
  Spanning trails containing given edges. 87-98
• 
  E. Maistrelli, D. B. Penman:
  Some colouring problems for Paley graphs. 99-106
• 
  Primoz Potocnik, Mateja Sajna:
  On almost self-complementary graphs. 107-123
• 
  Yunqing Xu, Yanxun Chang:
  Existence of r-self-orthogonal Latin squares. 124-146

Notes

• 
  Hiroyuki Nakasora:
  A construction of non self-orthogonal designs. 147-152
• 
  Wasin So:
  Integral circulant graphs. 153-158
• 
  Jun-Ming Xu, Chao Yang:
  Connectivity of Cartesian product graphs. 159-165
• 
  Raphael Yuster:
  Decomposing oriented graphs into transitive tournaments. 166-170

Volume 306, Number 2, 6 February 2006

Contributions

• 
  Gautam Appa, Dimitris Magos, Ioannis Mourtos, Jeannette C. M. Janssen:
  On the orthogonal Latin squares polytope. 171-187
• 
  José Cáceres, M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, María Luz Puertas, Carlos Seara:
  On geodetic sets formed by boundary vertices. 188-198
• 
  Eva Ferrara Dentice:
  On finite matroids with two more hyperplanes than points. 199-209
• 
  Joan Gimbert, Nacho López, Mirka Miller, Joseph F. Ryan:
  Characterization of eccentric digraphs. 210-219
• 
  Hirobumi Mizuno, Iwao Sato:
  Bartholdi zeta functions of some graphs. 220-230
• 
  Marek Niezgoda:
  Bifractional inequalities and convex cones. 231-243
• 
  Andrew Schultz:
  On a modification of a problem of Bialostocki, Erdos, and Lefmann. 244-253
• 
  Sherman K. Stein, Sándor Szabó:
  The number of distinct symbols in sections of rectangular arrays. 254-261
• 
  Wei-Fan Wang:
  Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers. 262-270

Notes

• 
  Frank Gurski:
  Characterizations for co-graphs defined by restricted NLC-width or clique-width operations. 271-277
• 
  Hideo Komuro, Kiyoshi Ando, Atsuhiro Nakamoto:
  Tight quadrangulations on the sphere. 278-283
• 
  Lian-Cui Zuo, Jianliang Wu, Jia-Zhuang Liu:
  The vertex linear arboricity of distance graphs. 284-289

Errata

• 
  Nawarat Ananchuen, Michael D. Plummer:
  Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13]. 291
• 
  Nawarat Ananchuen, Michael D. Plummer:
  Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15]. 292

Volume 306, Number 3, 28 February 2006

Minimal Separation and Minimal Triangulation

• 
  Anne Berry, Jean R. S. Blair, Geneviève Simonet:
  Preface. 293
• 
  Pinar Heggernes:
  Minimal triangulations of graphs: A survey. 297-317
• 
  Anne Berry, Pinar Heggernes, Yngve Villanger:
  A vertex incremental approach for maintaining chordality. 318-336
• 
  Hans L. Bodlaender, Arie M. C. A. Koster:
  Safe separators for treewidth. 337-350
• 
  L. Sunil Chandran, Fabrizio Grandoni:
  A linear time algorithm to list the minimal separators of chordal graphs. 351-358
• 
  L. Sunil Chandran, Telikepalli Kavitha:
  The treewidth and pathwidth of hypercubes. 359-365
• 
  Dieter Kratsch, Jeremy P. Spinrad:
  Minimal fill in O(n^2.69) time. 366-371
• 
  Frédéric Mazoit:
  Listing all the minimal separators of a 3-connected planar graph. 372-380
• 
  Stavros D. Nikolopoulos, Leonidas Palios:
  Minimal separators in P₄-sparse graphs. 381-392
• 
  Yngve Villanger:
  Lex M versus MCS-M. 393-400

Volume 306, Number 4, 6 March 2006

Contributions

• 
  Josep M. Brunat, Antonio Montes:
  On polynomial digraphs. 401-412
• 
  Severino Villanueva Gervacio, Hiroshi Maehara:
  Partial order on a family of k-subsets of a linearly ordered set. 413-419
• 
  Mark Huber:
  Fast perfect sampling from linear extensions. 420-428
• 
  R. S. Manikandan, P. Paulraja:
  C_p-decompositions of some regular graphs. 429-451

Communications

• 
  Vahan V. Mkrtchyan:
  A note on minimal matching covered graphs. 452-455
• 
  Vahan V. Mkrtchyan:
  On trees with a maximum proper partial 0-1 coloring containing a maximum matching. 456-459

Notes

• 
  Stanislav Busygin, Dmitrii V. Pasechnik:
  On NP-hardness of the clique partition - Independence number gap recognition and related problems. 460-463
• 
  Jin Ho Kwak, Ju-Mok Oh:
  Constructing one-regular graphs of valency 4k with non-cyclic vertex stabilizer. 464-468

Volume 306, Number 5, 28 March 2006

Contributions

• 
  Dominique Barth, Hervé Fournier:
  A degree bound on decomposable trees. 469-477
• 
  David T. Branson:
  Stirling number representations. 478-494
• 
  Denis Cornaz, Jean Fonlupt:
  Chromatic characterization of biclique covers. 495-507
• 
  Andrew D. King:
  Generating indecomposable permutations. 508-518
• 
  HoKyu Lee:
  Double perfect partitions. 519-525
• 
  Fred M. Hoppe:
  Improving probability bounds by optimization over subsets. 526-530

Communications

• 
  Lars-Daniel Öhman:
  The intricacy of avoiding arrays is 2. 531-532

Notes

• 
  Jianguo Qian:
  Degree complete graphs. 533-537

Volume 306, Number 6, 6 April 2006

• 
  Camino Balbuena, Ewan Barker, Kinkar Chandra Das, Yuqing Lin, Mirka Miller, Joseph F. Ryan, Slamin, Kiki A. Sugeng, Michal Tkác:
  On the degrees of a strongly vertex-magic graph. 539-551
• 
  Eric S. Egge:
  Restricted signed permutations counted by the Schröder numbers. 552-563
• 
  Toufik Mansour, Sherry H. F. Yan, Laura L. M. Yang:
  Counting occurrences of 231 in an involution. 564-572
• 
  Mickaël Montassier, André Raspaud, Weifan Wang:
  Bordeaux 3-color conjecture and 3-choosability. 573-579
• 
  Suk Jai Seo, Peter J. Slater:
  Competition-reachability of a graph. 580-590
• 
  Andrey A. Dobrynin, Leonid S. Melnikov:
  Counterexamples to Grötzsch-Sachs-Koester's conjecture. 591-594
• 
  Flavia Bonomo:
  Self-clique Helly circular-arc graphs. 595-597
• 
  Thomas Britz:
  On P-weight and P-distance inequalities. 598-599
• 
  Mike J. Grannell, Terry S. Griggs, Martin Knor, Jozef Sirán:
  Triangulations of orientable surfaces by complete tripartite graphs. 600-606
• 
  Kenji Kimura:
  Factors and vertex-deleted subgraphs. 607-611
• 
  Vladimir Nikiforov:
  The smallest eigenvalue of K_r-free graphs. 612-616

Volume 306, Number 7, 28 April 2006

• 
  Mekkia Kouider, Manouchehr Zaker:
  Bounds for the b-chromatic number of some families of graphs. 617-623
• 
  Piotr Sniady:
  Asymptotics of characters of symmetric groups, genus expansion and free probability. 624-665
• 
  Thomas Böhme, Martin Knor, Ludovít Niepel:
  Linkability in iterated line graphs. 666-669
• 
  Kefeng Diao, Guizhen Liu, Dieter Rautenbach, Ping Zhao:
  A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2. 670-672
• 
  Henry A. Kierstead:
  Weak acyclic coloring and asymmetric coloring games. 673-677
• 
  Imre Leader, Klas Markström:
  Uncountable families of vertex-transitive graphs of finite degree. 678-679
• 
  Manoel Lemos:
  Matroids with few non-common bases. 680-687
• 
  Haruhide Matsuda:
  Fan-type results for the existence of [a, b]-factors. 688-693
• 
  Øystein J. Rødseth:
  Enumeration of M-partitions. 694-698
• 
  Khaled Salem, Sandi Klavzar, Ivan Gutman:
  On the role of hypercubes in the resonance graphs of benzenoid graphs. 699-704
• 
  Zhao Zhang, Jixiang Meng:
  Semi-hyper-connected edge transitive graphs. 705-710

Volume 306, Numbers 8-9, 1 May 2006

Contributions

• 
  Fabrizio Caselli, Mario Marietti:
  Formulas for multi-parameter classes of Kazhdan-Lusztig polynomials in G(n). 711-725
• 
  Gary Chartrand, Sin-Min Lee, Ping Zhang:
  Uniformly cordial graphs. 726-737
• 
  Han Hyuk Cho, Suh-Ryung Kim, Jung Yeun Lee:
  On the graph inequality theta_E(G) geq theta_E(G^m). 738-744
• 
  Ellen E. Eischen:
  Decomposition of almost complete tripartite graphs into two isomorphic factors of fixed diameter. 745-761
• 
  Roland Häggkvist, Klas Markström:
  Cycle double covers and spanning minors II. 762-778
• 
  Edita Mácajová, Martin Skoviera:
  Irreducible snarks of given order and cyclic connectivity. 779-791
• 
  Yu-Ping Tsao, Gerard J. Chang:
  Profile minimization on products of graphs. 792-800
• 
  Inna Zverovich, Igor E. Zverovich:
  Bipartite bihypergraphs: A survey and new results. 801-811

Notes

• 
  Joseph E. Bonin:
  Extending a matroid by a cocircuit. 812-819
• 
  Kelli Carlson, Mike Develin:
  On the bondage number of planar and directed graphs. 820-826
• 
  David Eisenstat, Gary Gordon:
  Non-isomorphic caterpillars with identical subtree data. 827-830
• 
  Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác:
  On cycles through specified vertices. 831-835
• 
  Charles H. Jepsen, Ming Gu:
  Dissections of p: q rectangles into 13 p: q rectangular elements. 836-842
• 
  Andrzej P. Kisielewicz, Krzysztof Przeslawski:
  On the number of minimal partitions of a box into boxes. 843-846
• 
  Imre Leader, Paul A. Russell:
  Consistency for partition regular equations. 847-850

Volume 306, Numbers 10-11, 28 May 2006

35th Special Anniversary Issue

• 
  Peter L. Hammer:
  Preface. 851-852
• 
  Paul Erdös, Amram Meir, Vera T. Sós, Paul Turán:
  On some applications of graph theory, I. 853-866
• 
  László Lovász:
  Normal hypergraphs and the perfect graph conjecture. 867-875
• 
  Haim Hanani, Dwijendra K. Ray-Chaudhuri, Richard M. Wilson:
  On resolvable designs. 876-885
• 
  Vasek Chvátal:
  Edmonds polytopes and a hierarchy of combinatorial problems. 886-904
• 
  Richard P. Stanley:
  Acyclic orientations of graphs. 905-909
• 
  Vasek Chvátal:
  Tough graphs and hamiltonian circuits. 910-917
• 
  László Babai:
  Automorphism groups of graphs and edge-contraction. 918-922
• 
  Paul Erdös, Daniel J. Kleitman:
  Extremal problems among subsets of a set. 923-931
• 
  W. T. Tutte:
  Spanning subgraphs with specified valencies. 932-938
• 
  Andries E. Brouwer, Alexander Schrijver, Haim Hanani:
  Group divisible designs with block-size four. 939-947
• 
  Béla Bollobás, Andrew Thomason:
  Set colourings of graphs. 948-952
• 
  Oleg V. Borodin:
  On acyclic colorings of planar graphs. 953-972
• 
  Alexander Schrijver, Paul D. Seymour:
  Solution of two fractional packing problems of Lovász. 973-978
• 
  Paul D. Seymour:
  Disjoint paths in graphs. 979-991
• 
  Philippe Flajolet:
  Combinatorial aspects of continued fractions. 992-1021
• 
  Ira M. Gessel:
  A q-analog of the exponential formula. 1022-1031
• 
  János Komlós, Endre Szemerédi:
  Limit distribution for the existence of Hamiltonian cycles in a random graph. 1032-1038
• 
  Doron Zeilberger, David M. Bressoud:
  A proof of Andrews' q-Dyson conjecture. 1039-1059
• 
  Luc Teirlinck:
  Non-trivial t-designs without repeated blocks exist for all t. 1060-1067
• 
  Noga Alon, Fan R. K. Chung:
  Explicit construction of linear sized tolerant networks. 1068-1071
• 
  Doron Zeilberger:
  A fast algorithm for proving terminating hypergeometric identities. 1072-1075
• 
  Margit Voigt:
  List colourings of planar graphs. 1076-1079
• 
  Sergey Fomin, Curtis Greene:
  Noncommutative Schur functions and their applications. 1080-1096

Volume 306, Number 12, 28 June 2006

Contributions

• 
  Ahmed Ainouche, Serge Lapiquonne:
  Hamilton connectedness and the partially square graphs. 1097-1104
• 
  Gergely Ambrus, János Barát:
  A contribution to queens graphs: A substitution method. 1105-1114
• 
  Fethi Ben Saïd, Houda Lahouar, Jean-Louis Nicolas:
  On the counting function of the sets of parts A such that the partition function p(A, n) takes even values for n large enough. 1115-1125
• 
  Simon R. Blackburn, Igor E. Shparlinski:
  Character sums and nonlinear recurrence sequences. 1126-1131
• 
  Chiuyuan Chen, Chih-Shin Hung, Wen-Shiang Tang:
  On the existence of hyper-L triple-loop networks. 1132-1138
• 
  Ming-You Chen, Frank K. Hwang, Chih-Hung Yen:
  Tessellating polyominos in the plane. 1139-1144
• 
  Nicolas Lichiardopol:
  Independence number of de Bruijn graphs. 1145-1160
• 
  Toufik Mansour:
  Restricted even permutations and Chebyshev polynomials. 1161-1176
• 
  Romeo Rizzi:
  Acyclically pushable bipartite permutation digraphs: An algorithm. 1177-1188
• 
  Ngo Dac Tuan:
  Hypergraphical t-designs. 1189-1197
• 
  Lutz Volkmann:
  On cycles in regular 3-partite tournaments. 1198-1206
• 
  Aifeng Yang, Jinjiang Yuan:
  Partition the vertices of a graph into one independent set and one acyclic set. 1207-1216
• 
  Roger K. Yeh:
  A survey on labeling graphs with a condition at distance two. 1217-1231

Communications

• 
  Edwin Soedarmadji:
  Latin hypercubes and MDS codes. 1232-1239

Notes

• 
  Haitao Cao:
  Resolvable packings RtildeMP(3, 2; n, n-3) and coverings RtildeMC(3, 2; n, n-2). 1240-1246
• 
  Sayan Panma, N. Na Chiangmai, Ulrich Knauer, Sr. Arworn:
  Characterizations of Clifford semigroup digraphs. 1247-1252
• 
  Daniel C. Slilaty:
  Bias matroids with unique graphical representations. 1253-1256

Volume 306, Number 13, 6 July 2006

Contributions

• 
  Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco:
  The smallest size of a complete cap in PG(3, 7). 1257-1263
• 
  Bostjan Bresar, Sandi Klavzar:
  Theta-graceful labelings of partial cubes. 1264-1271
• 
  Marc Chastand, Norbert Polat:
  On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs. 1272-1284
• 
  Robert G. Donnelly, Scott J. Lewis, Robert Pervine:
  Solitary and edge-minimal bases for representations of the simple lie algebra G₂. 1285-1300
• 
  Lynne L. Doty:
  A new bound for neighbor-connectivity of Abelian Cayley graphs. 1301-1316
• 
  Anatolij Dvurecenskij, Jirí Rachunek:
  Probabilistic averaging in bounded commutative residuated l-monoids. 1317-1326
• 
  Petr Gregor:
  Recursive fault-tolerance of Fibonacci cube in hypercubes. 1327-1341
• 
  Mohammad Hosseini Dolama, Éric Sopena:
  On the oriented chromatic number of graphs with given excess. 1342-1350
• 
  Wen-Chung Huang:
  Extended directed triple systems. 1351-1357
• 
  Janja Jerebic, Sandi Klavzar:
  On induced and isometric embeddings of graphs into the strong product of paths. 1358-1363
• 
  Shin-Shin Kao, Kung-Ming Hsu, Lih-Hsing Hsu:
  Cubic planar hamiltonian graphs of various types. 1364-1389
• 
  Romeo Rizzi, Marco Rospocher:
  Covering partially directed graphs with directed paths. 1390-1404
• 
  Boris A. Romov:
  The completeness problem in partial hyperclones. 1405-1414
• 
  Fuji Zhang, Heping Zhang:
  Construction for bicritical graphs and k-extendable bipartite graphs. 1415-1423
• 
  Zhizheng Zhang, Maixue Liu:
  Applications of operator identities to the multiple q-binomial theorem and q-Gauss summation theorem. 1424-1437

Communications

• 
  Nechemia Burshtein:
  Improving solutions of sum(from i=1 to k)(1/x_i) = 1 with restrictions as required by Barbeau respectively by Johnson. 1438-1439

Notes

• 
  Yuehua Bu, Weifan Wang:
  Some sufficient conditions for a planar graph of maximum degree six to be Class 1. 1440-1445
• 
  William Y. C. Chen, Qing-Hu Hou:
  Factors of the Gaussian coefficients. 1446-1449
• 
  Xuechao Li, Rong Luo, Jianbing Niu:
  A note on class one graphs with maximum degree six. 1450-1455
• 
  Dieter Rautenbach:
  Some remarks about leaf roots. 1456-1461

Volume 306, Number 14, July 2006

R.C. Bose Centennial Symposium on discrete mathmematics and Applications

• 
  Bimal Kumar Roy, A. R. Rao, Dwijendra K. Ray-Chaudhuri:
  Foreword. 1463
• 
  K. T. Arasu, Grady Burkett, Michael Linger:
  Existence status of some previously open abelian difference sets. 1467-1473
• 
  Tiru S. Arthanari:
  On pedigree polytopes and Hamiltonian cycles. 1474-1492
• 
  Alphonse Baartmans, Sharad S. Sane:
  A characterization of projective subspaces of codimension two as quasi-symmetric designs with good blocks. 1493-1501
• 
  Bhaskar Bagchi:
  On strongly regular graphs with µ <=2. 1502-1504
• 
  Robert Benkoczi, Binay K. Bhattacharya, David Breton:
  Efficient computation of 2-medians in a tree network with positive/negative weights. 1505-1516
• 
  Subir Kumar Bhandari, Mausumi Bose:
  Some results related to permanental inequalities. 1517-1521
• 
  Derek Bingham, Rahul Mukerjee:
  Detailed wordlength pattern of regular fractional factorial split-plot designs in terms of complementary sets. 1522-1533
• 
  Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi:
  Labeling trees with a condition at distance two. 1534-1539
• 
  Sugata Gangopadhyay, Pradipkumar H. Keskar, Subhamoy Maitra:
  Patterson-Wiedemann construction revisited. 1540-1556
• 
  Yury J. Ionin, Mohan S. Shrikhande:
  Decomposable symmetric designs. 1557-1568
• 
  Meena Mahajan, Raghavan Rama, Vijayakumar Sundarrajan:
  On sorting by 3-bounded transpositions. 1569-1585
• 
  Sounaka Mishra, Siddani Bhaskara Rao:
  Minimum monopoly in regular and tree graphs. 1586-1594
• 
  A. R. Rao:
  The number of reachable pairs in a digraph. 1595-1600
• 
  Malay K. Sen, P. Talukdar, Sandip Das:
  Chronological orderings of interval digraphs. 1601-1609
• 
  N. M. Singhi:
  Tags on subsets. 1610-1623
• 
  V. Swaminathan, P. Jeyanthi:
  Super edge-magic strength of fire crackers, banana trees and unicyclic graphs. 1624-1636

Volume 306, Number 15, August 2006

• 
  Frank Gurski:
  Linear layouts measuring neighbourhoods in graphs. 1637-1650
• 
  Teturo Kamae, Hui Rao, Bo Tan, Yu-Mei Xue:
  Language structure of pattern Sturmian words. 1651-1668
• 
  Bertrand Lemaire, Marc Le Menestrel:
  Homothetic interval orders. 1669-1683
• 
  Vadim E. Levit, Eugen Mandrescu:
  On alpha-critical edges in König-Egerváry graphs. 1684-1693
• 
  Mark S. MacLean, Paul M. Terwilliger:
  Taut distance-regular graphs and the subconstituent algebra. 1694-1721
• 
  Dong Yeol Oh:
  A classification of the structures of some Sperner families and superimposed codes. 1722-1731
• 
  Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
  Ordered trees and the inorder traversal. 1732-1741
• 
  Yuansheng Yang, Xiaohui Lin, Qiao Jing:
  The face pair of planar graphs. 1742-1757

Notes

• 
  Richard C. Brewster, Gary MacGillivray:
  Building blocks for the variety of absolute retracts. 1758-1764
• 
  Serkan Eryilmaz:
  A note on runs of geometrically distributed random variables. 1765-1770
• 
  Liying Kang, Erfang Shan, Louis Caccetta:
  Total minus domination in k-partite graphs. 1771-1775
• 
  Xavier Le Breton:
  Linear independence of automatic formal power series. 1776-1780
• 
  Zhenheng Li, Zhuo Li, You'an Cao:
  Enumeration of symplectic and orthogonal injective partial transformations. 1781-1787
• 
  Rong Luo, Yue Zhao:
  A note on Vizing's independence number conjecture of edge chromatic critical graphs. 1788-1790
• 
  Criel Merino, Gelasio Salazar, Jorge Urrutia:
  On the length of longest alternating paths for multicoloured point sets in convex position. 1791-1797
• 
  Zhaoyang Wu, Zhi-Wei Sun:
  On the unique representability of spikes over prime fields. 1798-1804
• 
  Corrado Zanella:
  Blocking sets in line Grassmannians. 1805-1811
• 
  Min Zhao, Liying Kang, Gerard J. Chang:
  Power domination in graphs. 1812-1816

Volume 306, Number 16, August 2006

• 
  Camino Balbuena, Ewan Barker, Yuqing Lin, Mirka Miller, Kiki A. Sugeng:
  Consecutive magic graphs. 1817-1829
• 
  Jørgen Bang-Jensen, Morten Hegner Nielsen, Anders Yeo:
  Longest path partitions in generalizations of tournaments. 1830-1839
• 
  Mostafa Blidia, Mustapha Chellali, Teresa W. Haynes:
  Characterizations of trees with equal paired and double domination numbers. 1840-1845
• 
  Marc Chastand, Norbert Polat:
  On geodesic structures of weakly median graphs - II: Compactness, the role of isometric rays. 1846-1861
• 
  Carlos A. Di Prisco, Stevo Todorcevic:
  Canonical forms of shift-invariant maps on [N]^infinity. 1862-1870
• 
  David G. Glynn, T. Aaron Gulliver, Manish K. Gupta:
  Linear transformations on codes. 1871-1880
• 
  Klavdija Kutnar, Aleksander Malnic, Dragan Marusic, Stefko Miklavic:
  Distance-balanced graphs: Symmetry conditions. 1881-1894
• 
  Guangrong Li, Limin Zhang:
  Total chromatic number of one kind of join graphs. 1895-1905
• 
  Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
  The Cauchy numbers. 1906-1920
• 
  Hao Pan, Zhi-Wei Sun:
  A combinatorial identity with application to Catalan numbers. 1921-1940
• 
  Yee Hock Peng, Y. C. Yiew:
  The crossing number of P(3, 1)×P_n. 1941-1946
• 
  Alexander Schwartz:
  The deficiency of a regular graph. 1947-1954

Notes

• 
  Mieczyslaw Borowiecki, Stanislav Jendrol', Daniel Král, Jozef Miskuf:
  List coloring of Cartesian products of graphs. 1955-1958
• 
  Sebastian M. Cioaba:
  Sums of powers of the degrees of a graph. 1959-1964
• 
  Véronique Cortier, Xavier Goaoc, Mira Lee, Hyeon-Suk Na:
  A note on maximally repeated sub-patterns of a point set. 1965-1968
• 
  Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
  Kernels in quasi-transitive digraphs. 1969-1974
• 
  Olof Heden:
  A remark on full rank perfect codes. 1975-1980
• 
  Martin Hessler:
  Perfect codes as isomorphic spaces. 1981-1987
• 
  Mathew Cropper, András Gyárfás, Jenö Lehel:
  Hall ratio of the Mycielski graphs. 1988-1990
• 
  Victor Kostyuk, Darren A. Narayan, Victoria A. Williams:
  Minimal rankings and the arank number of a path. 1991-1996
• 
  Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Taozhi Shui, Suohai Fan:
  Conditional colorings of graphs. 1997-2004
• 
  Øystein J. Rødseth:
  Sloane's box stacking problem. 2005-2009
• 
  Yu Sheng, Feng Tian, Jianglu Wang, Bing Wei, Yongjin Zhu:
  Path extendability of claw-free graphs. 2010-2015
• 
  Amr M. Youssef, Stafford E. Tavares, Guang Gong:
  On some probabilistic approximations for AES-like s-boxes. 2016-2020

Volume 306, Number 17, September 2006

• 
  Geir Agnarsson, Li Chen:
  On the extension of vertex maps to graph homomorphisms. 2021-2030
• 
  Mostafa Blidia, Mustapha Chellali, Lutz Volkmann:
  Some bounds on the p-domination number in trees. 2031-2037
• 
  Robert Brier, Darryn E. Bryant:
  Varieties of algebras arising from K-perfect m-cycle systems. 2038-2046
• 
  Nicholas J. Cavenagh, Diane M. Donovan, Emine Sule Yazici:
  Minimal homogeneous latin trades. 2047-2055
• 
  David Conlon:
  Rainbow solutions of linear equations over Z_p. 2056-2063
• 
  T. Aaron Gulliver, Masaaki Harada:
  Classification of extremal double circulant self-dual codes of lengths 74-88. 2064-2072
• 
  Manuel Kauers, Carsten Schneider:
  Indefinite summation with unspecified summands. 2073-2083
• 
  Nigel Martin:
  Unbalanced bipartite factorizations of complete bipartite graphs. 2084-2090
• 
  Jun-Jie Pan, Gerard J. Chang:
  Isometric path numbers of graphs. 2091-2096
• 
  Oleg Pikhurko:
  Dense edge-magic graphs and thin additive bases. 2097-2107

Notes

• 
  Atif A. Abueida, R. Sritharan:
  A note on the recognition of bisplit graphs. 2108-2110
• 
  Demetres Christofides:
  Pair lengths of product graphs. 2111-2114
• 
  Hong-Jian Lai, Xiangjuan Yao:
  Collapsible biclaw-free graphs. 2115-2117
• 
  Hao Pan:
  Arithmetic properties of q-Fibonacci numbers and q-pell numbers. 2118-2127
• 
  Talmage James Reid, Jakayla R. Robbins:
  A note on clone sets in representable matroids. 2128-2130
• 
  Svetoslav Savchev, Fang Chen:
  A note on maximal progression-free sets. 2131-2133
• 
  Murali K. Srinivasan:
  The Eulerian generating function of q-derangements. 2134-2140

Volume 306, Number 18, September 2006

• 
  Veerle Fack, Svetlana Topalova, Joost Winne, Rosen Zlatarski:
  Enumeration of the doubles of the projective plane of order 4. 2141-2151
• 
  Jerzy Jaworski, Michal Karonski, Dudley Stark:
  The degree of a typical vertex in generalized random intersection graph models. 2152-2165
• 
  Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan:
  Transversal numbers of translates of a convex body. 2166-2173
• 
  Lawrence Somer, Michal Krízek:
  Structure of digraphs associated with quadratic congruences with composite moduli. 2174-2185
• 
  Richard Stong:
  Hamilton decompositions of directed cubes and products. 2186-2204
• 
  Chuixiang Zhou, Yan-Quan Feng:
  An infinite family of tetravalent half-arc-transitive graphs. 2205-2211

Notes

• 
  Maria Axenovich, Ryan R. Martin:
  A note on short cycles in a hypercube. 2212-2218
• 
  Ankur Bohra, L. Sunil Chandran, J. Krishnam Raju:
  Boxicity of series-parallel graphs. 2219-2221
• 
  Chak-On Chow:
  Counting involutory, unimodal, and alternating signed permutations. 2222-2228
• 
  Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu C. Laskar:
  Simultaneous graph parameters: Factor domination and factor total domination. 2229-2233
• 
  Yingpu Deng:
  A class of combinatorial identities. 2234-2240
• 
  Miguel Angel Fiol, Ernest Garriga:
  On the spectrum of an extremal graph with four eigenvalues. 2241-2244
• 
  Tomás Kaiser:
  A note on interconnecting matchings in graphs. 2245-2250
• 
  Michael La Croix:
  A combinatorial proof of a result of Gessel and Greene. 2251-2256
• 
  Jianguo Qian, Hong Lin:
  Graph colourings and solutions of systems of equations over finite fields. 2257-2262
• 
  Andrea Semanicová:
  On magic and supermagic circulant graphs. 2263-2269
• 
  L. Sunil Chandran, Telikepalli Kavitha:
  The carvingwidth of hypercubes. 2270-2274
• 
  Mario Valencia-Pabon, Juan Vera:
  Independence and coloring properties of direct products of some vertex-transitive graphs. 2275-2281
• 
  Malgorzata Zwonek:
  A note on total colourings of digraphs. 2282-2291

Volume 306, Numbers 19-20, October 2006

Creation and Recreation: A Tribute to the Memory of Claude Berge

• 
  J. Adrian Bondy, Vasek Chvátal:
  Preface. 2293-2295
• 
  David Avis, Antoine Deza:
  Un des "problèmes plaisans et délectables" de Claude Berge. 2299-2302
• 
  Imre Bárány, Jirí Matousek:
  Berge's theorem, fractional Helly, and art galleries. 2303-2313
• 
  Mostafa Blidia, Mustapha Chellali, Frédéric Maffray:
  Extremal graphs for a new upper bound on domination parameters in graphs. 2314-2326
• 
  Anthony Bonato, Kathie Cameron:
  On an adjacency property of almost all tournaments. 2327-2335
• 
  Endre Boros, Vladimir Gurvich:
  Perfect graphs, kernels, and cores of cooperative games. 2336-2354
• 
  Paul Camion:
  Unimodular modules. 2355-2382
• 
  Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
  How to build a brick. 2383-2410
• 
  Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic:
  Balanced matrices. 2411-2437
• 
  Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein:
  Extended skew partition problem. 2438-2449
• 
  Tomás Feder, Pavol Hell:
  Matrix partitions of perfect graphs. 2450-2460
• 
  Celina M. H. de Figueiredo, Chính T. Hoàng, Frédéric Maffray:
  A characterization of P₄-comparability graphs. 2461-2472
• 
  Hortensia Galeana-Sánchez:
  Kernels and perfectness in arc-local tournament digraphs. 2473-2480
• 
  András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
  Odd cycles and Theta-cycles in hypergraphs. 2481-2491
• 
  Gena Hahn, Gary MacGillivray:
  A note on k-cop, l-robber games on graphs. 2492-2497
• 
  Irith Ben-Arroyo Hartman:
  Berge's conjecture on directed path partitions - a survey. 2498-2514
• 
  Ryan B. Hayward, Jack van Rijswijck:
  Hex and combinatorics. 2515-2528
• 
  Stefan Hougardy:
  Classes of perfect graphs. 2529-2571
• 
  Kenji Kashiwabara, Tadashi Sakuma:
  Grinstead's conjecture is true for graphs with a small clique number. 2572-2581
• 
  András Sebö:
  A Berge-keeping operation for graphs. 2582-2592
• 
  Gábor Simonyi:
  Asymptotic values of the Hall-ratio for graph powers. 2593-2601
• 
  Hui-Yu Wang:
  Which claw-free graphs are strongly perfect? 2602-2629
• 
  Dominique de Werra:
  Good and nice colorings of balanced hypergraphs. 2630-2636

Volume 306, Number 21, November 2006

• 
  G. K. Bennett, Mike J. Grannell, Terry S. Griggs, Vladimir P. Korzhik, Jozef Sirán:
  Small surface trades in triangular embeddings. 2637-2646
• 
  Michael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt:
  Construction of trees and graphs with equal domination parameters. 2647-2654
• 
  Wenqing Dou, Jingzhen Gao:
  The (mod, integral) sum numbers of fans and K_{n, n}-E(nK₂). 2655-2669
• 
  Iiro S. Honkala:
  An optimal locating-dominating set in the infinite triangular grid. 2670-2681
• 
  Mingchu Li:
  Circumferences of regular claw-free graphs. 2682-2694
• 
  Giovanni Lo Faro, Antoinette Tripodi:
  The Doyen-Wilson theorem for kite systems. 2695-2701
• 
  B. P. Tan:
  On the 3-kings and 4-kings in multipartite tournaments. 2702-2710
• 
  Hugh Thomas:
  Tamari lattices and noncrossing partitions in type B. 2711-2723
• 
  Lutz Volkmann, Stefan Winzen:
  Paths with a given number of vertices from each partite set in regular multipartite tournaments. 2724-2732
• 
  Fuji Zhang, Zhibo Chen:
  On commutativity of two unary digraph operations: Subdividing and line-digraphing. 2733-2739
• 
  Zhizheng Zhang:
  On a kind of curious binomial identity. 2740-2754

Communications

• 
  Alexander K. Kelmans:
  On Hamiltonicity of {claw, net}-free graphs. 2755-2761

Notes

• 
  S. Amghibech:
  Bounds for the largest p-Laplacian eigenvalue for graphs. 2762-2771
• 
  Daniel W. Cranston:
  Strong edge-coloring of graphs with maximum degree 4 using 22 colors. 2772-2778
• 
  Atsushi Kaneko, Kazuhiro Suzuki:
  Packing two copies of a tree into its third power. 2779-2785
• 
  André E. Kézdy:
  rho-Valuations for some stunted trees. 2786-2789
• 
  Manoel Lemos:
  Elements belonging to triangles in 3-connected matroids. 2790-2797
• 
  Gabriel Nivasch:
  The Sprague-Grundy function of the game Euclid. 2798-2800
• 
  Yidong Sun:
  Two classes of p-Stirling numbers. 2801-2805
• 
  Taro Tokuda:
  Connected factors in K_{1, n}-free graphs containing an [a, b]-factor. 2806-2810
• 
  Kaishun Wang:
  A family of weakly distance-regular digraphs of girth 2. 2811-2815

Volume 306, Number 22, November 2006

• 
  Talip Atajan, Xuerong Yong, Hiroshi Inaba:
  Further analysis of the number of spanning trees in circulant graphs. 2817-2827
• 
  Julien Bernat:
  Continued fractions and numeration in the Fibonacci base. 2828-2850
• 
  Alexander Burstein, Sergi Elizalde, Toufik Mansour:
  Restricted Dumont permutations, Dyck paths, and noncrossing partitions. 2851-2869
• 
  Yuguo Chen:
  Simple existence conditions for zero-one matrices with at most one structural zero in each row and column. 2870-2877
• 
  Ian D. Gray, Jim A. MacDougall:
  Sparse anti-magic squares and vertex-magic labelings of bipartite graphs. 2878-2892
• 
  Gee-Choon Lau, Y. H. Peng:
  Chromaticity of certain tripartite graphs identified with a path. 2893-2900
• 
  Vadim V. Lozin, Raffaele Mosca:
  Polar graphs and maximal independent sets. 2901-2908
• 
  Feng-Gao Li, Yang-Xian Wang:
  A class of amply regular graphs related to the subconstituents of a dual polar graph. 2909-2915
• 
  Cosmin Pelea:
  On the direct limit of a direct system of multialgebras. 2916-2930
• 
  Lutz Volkmann:
  Longest cycles in almost regular 3-partite tournaments. 2931-2942
• 
  Jun-Ming Xu, Fang Tian, Jia Huang:
  Distance irredundance and connected domination numbers of a graph. 2943-2953

Notes

• 
  Watcharaphong Ananchuen, Lou Caccetta:
  Cubic and quadruple Paley graphs with the n-e.c. property. 2954-2961
• 
  Stefan Hougardy:
  On a conjecture of Hoàng and Tu concerning perfectly orderable graphs. 2962-2963
• 
  Sandi Klavzar:
  Counting hypercubes in hypercubes. 2964-2967
• 
  Jaromy Scott Kuhl, Tristan Denley:
  On avoiding odd partial Latin squares and r-multi Latin squares. 2968-2975
• 
  Roland Lortz:
  A note on the Ramsey number of K_{2, 2} versus K_{3, n}. 2976-2982
• 
  Weiping Shang, Jinjiang Yuan:
  Upper minus domination in a claw-free cubic graph. 2983-2988

Volume 306, Number 23, December 2006

International Workshop on Combinatorics, Linear Algebra, and Graph Coloring

• 
  Richard A. Brualdi, A. Samad Hedayat, Hadi Kharaghani, Gholamreza B. Khosrovshahi, Shahriar Shahriari:
  Preface. 2989
• 
  Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie:
  Large sets of t-designs through partitionable sets: A survey. 2993-3004
• 
  Saeed Akbari, Hoda Bidkhori, N. Nosrati:
  r-Strong edge colorings of graphs. 3005-3010
• 
  Saeed Akbari, Omid Etesami, H. Mahini, Mohammad Mahmoody, Arash Sharifi:
  Transversals in long rectangular arrays. 3011-3013
• 
  Rosemary A. Bailey, Peter J. Cameron, Peter Dobcsányi, John P. Morgan, Leonard H. Soicher:
  Designs on the web. 3014-3027
• 
  Richard Bean:
  Latin trades on three or four rows. 3028-3041
• 
  Majid Behbahani, Hadi Kharaghani:
  On a new class of productive regular Hadamard matrices. 3042-3050
• 
  Andries E. Brouwer, Peter J. Cameron, Willem H. Haemers, Donald A. Preece:
  Self-dual, not self-polar. 3051-3053
• 
  Richard A. Brualdi:
  Algorithms for constructing (0, 1)-matrices with prescribed row and column sum vectors. 3054-3062
• 
  Peter J. Cameron, Hamid Reza Maimani, G. R. Omidi, Behruz Tayfeh-Rezaie:
  3-Designs from PSL(2, q). 3063-3073
• 
  Peter J. Cameron, Charles R. Johnson:
  The number of equivalence classes of symmetric sign patterns. 3074-3077
• 
  Saieed Akbari, Hamid-Reza Fanaï:
  Some relations among term rank, clique number and list chromatic number of a graph. 3078-3082
• 
  Nick C. Fiala, Willem H. Haemers:
  5-chromatic strongly regular graphs. 3083-3096
• 
  Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán:
  On set systems with a threshold property. 3097-3111
• 
  A. Sadam Hedayat, Min Yang:
  Efficient crossover designs for comparing test treatments with a control treatment. 3112-3124
• 
  Charles R. Johnson, António Leal Duarte:
  Converse to the Parter-Wiener theorem: The case of non-trees. 3125-3129
• 
  Charles R. Johnson, Carlos M. Saiago:
  The trees for which maximum multiplicity implies the simplicity of other eigenvalues. 3130-3135
• 
  Reza Naserasr, Yared Nigussie:
  On a new reformulation of Hadwiger's conjecture. 3136-3139
• 
  Tim Hsu, Mark J. Logan, Shahriar Shahriari:
  The generalized Füredi conjecture holds for finite linear lattices. 3140-3144
• 
  Carsten Thomassen:
  The number of k-colorings of a graph on a fixed surface. 3145-3153
• 
  Richard M. Wilson:
  A lemma on polynomials modulo p^m and applications to coding theory. 3154-3165
• 
  Manouchehr Zaker:
  Results on the Grundy chromatic number of graphs. 3166-3173
• 
  Peter J. Cameron:
  Research problems from the 2003 IPM Workshop. 3174-3179

Volume 306, Number 24, December 2006

• 
  Kazutoshi Ando:
  Extreme point axioms for closure spaces. 3181-3188
• 
  Gek Ling Chia, W. K. Kok:
  On non-symmetric commutative association schemes with exactly one pair of non-symmetric relations. 3189-3222
• 
  Miguel Couceiro, Stephan Foldes, Erkko Lehtonen:
  Composition of Post classes and normal forms of Boolean functions. 3223-3243
• 
  David Erwin, Frank Harary:
  Destroying automorphisms by fixing nodes. 3244-3252
• 
  Roland Glantz, Marcello Pelillo:
  Graph polynomials from principal pivoting. 3253-3266
• 
  Pinar Heggernes, Daniel Lokshtanov:
  Optimal broadcast domination in polynomial time. 3267-3280
• 
  Alexandre Pinlou, Éric Sopena:
  The acircuitic directed star arboricity of subcubic graphs is at most four. 3281-3289
• 
  Chin-Lin Shiue, Hung-Lin Fu:
  alpha-labeling number of trees. 3290-3296

Notes

• 
  Edy Tri Baskoro, Hasmawati, Hilda Assiyatun:
  The Ramsey numbers for disjoint unions of trees. 3297-3301
• 
  Komei Fukuda, Antoine Musitelli:
  New polynomial-time algorithms for Camion bases. 3302-3306
• 
  Massimo Giulietti, Elisa Montanucci:
  On hyperfocused arcs in PG(2, q). 3307-3314
• 
  Gregory Z. Gutin, Arash Rafiey, Simone Severini, Anders Yeo:
  Hamilton cycles in digraphs of unitary matrices. 3315-3320
• 
  Stanislav Jendrol':
  Rainbowness of cubic plane graphs. 3321-3326
• 
  Daniel Meister:
  Two characterisations of minimal triangulations of 2K₂-free graphs. 3327-3333
• 
  Surahmat, Edy Tri Baskoro, Ioan Tomescu:
  The Ramsey numbers of large cycles versus wheels. 3334-3337
• 
  Hua-ming Xing, Xin Chen, Xue-Gang Chen:
  A note on Roman domination in graphs. 3338-3340