Discrete Mathematics, Volume 307

Volume 307, Number 1, January 2007

• 
  Grzegorz Binczak, Anna B. Romanowska, Jonathan D. H. Smith:
  Poset extensions, convex sets, and semilattice presentations. 1-11
• 
  Ernest J. Cockayne:
  Irredundance, secure domination and maximum degree in trees. 12-17
• 
  D. Deng, Douglas R. Stinson, Pak Ching Li, G. H. John van Rees, Ruizhong Wei:
  Constructions and bounds for (m, t)-splitting systems. 18-37
• 
  Jun Fujisawa:
  Heavy fans, cycles and paths in weighted graphs of large connectivity. 38-53
• 
  Anka Golemac, Josko Mandic, Tanja Vucicic:
  On the existence of difference sets in groups of order 96. 54-68
• 
  Gerzson Kéri, Patric R. J. Östergård:
  Further results on the covering radius of small codes. 69-77
• 
  Zhaoxiang Li, Yanpei Liu:
  Chromatic sums of general maps on the sphere and the projective plane. 78-87
• 
  Ortrud R. Oellermann, María Luz Puertas:
  Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs. 88-96
• 
  Maurice Pouzet, Imed Zaguia:
  Weak orders admitting a perpendicular linear order. 97-107

Notes

• 
  Nawarat Ananchuen, Lou Caccetta, Watcharaphong Ananchuen:
  A characterization of maximal non-k-factor-critical graphs. 108-114
• 
  Ivan Chajda:
  Orthomodular semilattices. 115-118
• 
  Shao-Fei Du, Jin Ho Kwak, Roman Nedela:
  Classification of regular embeddings of hypercubes of odd dimension. 119-124
• 
  Haicheng Ma, Haizhen Ren:
  The new methods for constructing matching-equivalence graphs. 125-131
• 
  Aidan Roy, Gordon F. Royle:
  The chromatic number and rank of the complements of the Kasami graphs. 132-136
• 
  Yongqi Sun, Yuansheng Yang, Xiaohui Lin, Qiao Jing:
  The planar Ramsey number PR(K₄-e, K₅). 137-142

Volume 307, Number 2, January 2007

• 
  Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote:
  Connectivity of graphs with given girth pair. 155-162
• 
  Bostjan Bresar, Jaroslaw Grytczuk, Sandi Klavzar, Staszek Niwczyk, Iztok Peterin:
  Nonrepetitive colorings of trees. 163-172
• 
  Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah:
  On defining numbers of circular complete graphs. 173-180
• 
  Zdenek Dvorák, Riste Skrekovski, Tomás Valla:
  Four gravity results. 181-190
• 
  Jonathan David Farley:
  A structure theorem for posets admitting a "strong" chain partition: : A generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities). 191-198
• 
  Arnfried Kemnitz, Massimiliano Marangio:
  [r, s, t]-Colorings of graphs. 199-207
• 
  Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen:
  Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs. 208-215
• 
  José G. Mijares:
  Parametrizing the abstract Ellentuck theorem. 216-225
• 
  William P. Orrick, Bruce Solomon:
  Large-determinant sign matrices of order 4k+1. 226-236
• 
  Iwao Sato:
  Zeta functions and complexities of a semiregular bipartite graph and its line graph. 237-245
• 
  Yingshan Zhang:
  Orthogonal arrays obtained by repeating-column difference matrices. 246-261

Notes

• 
  Mustapha Aouchiche, Pierre Hansen:
  On a conjecture about the Randic index. 262-265
• 
  L. Sunil Chandran, Naveen Sivadasan:
  On the Hadwiger's conjecture for graph products. 266-273
• 
  Masahiro Hachimori, Kenji Kashiwabara:
  On the topology of the free complexes of convex geometries. 274-279
• 
  Shengbiao Hu:
  The largest eigenvalue of unicyclic graphs. 280-284
• 
  Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
  On the spanning connectivity of graphs. 285-289
• 
  Lingsheng Shi:
  The tail is cut for Ramsey numbers of cubes. 290-292
• 
  Zhao Zhang, Jinjiang Yuan:
  Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal. 293-298

Volume 307, Numbers 3-5, February 2007

Algebraic and Topological Methods in Graph Theory

• 
  Sandi Klavzar, Dragan Marusic, Bojan Mohar, Tomaz Pisanski:
  Preface. 299
• 
  Janez Ales, Bojan Mohar, Tomaz Pisanski:
  Heuristic search for Hamilton cycles in cubic graphs. 303-309
• 
  Vladimir Batagelj, Matjaz Zaversnik:
  Short cycle connectivity. 310-318
• 
  Halina Bielak:
  Ramsey and 2-local Ramsey numbers for disjoint unions of cycles. 319-330
• 
  Marko Boben:
  Irreducible (v₃) configurations and graphs. 331-344
• 
  Bostjan Bresar, Sandi Klavzar, Riste Skrekovski:
  On cube-free median graphs. 345-351
• 
  Jason I. Brown, Richard J. Nowakowski:
  The well-covered dimension of random graphs. 352-355
• 
  Irène Charon, Olivier Hudry, Antoine Lobstein:
  Extremal cardinalities for identifying and locating-dominating codes in graphs. 356-366
• 
  Marston D. E. Conder, Steve Wilson:
  Inner reflectors and non-orientable regular maps. 367-372
• 
  Edward Dobson, Aleksander Malnic, Dragan Marusic, Lewis A. Nowitz:
  Minimal normal subgroups of transitive permutation groups of square-free degree. 373-385
• 
  Tomás Feder, Pavol Hell, Jing Huang:
  List homomorphisms of graphs with bounded degrees. 386-392
• 
  Tomás Feder, Pavol Hell, Jing Huang:
  The structure of bi-arc trees. 393-401
• 
  Gasper Fijavz:
  Hadwiger's conjecture for circular colorings of edge-weighted graphs. 402-408
• 
  Aleksander Malnic, Dragan Marusic, Primoz Sparl, Bostjan Frelih:
  Symmetry structure of bicirculants. 409-414
• 
  Michael Giudici, Cai Heng Li, Primoz Potocnik, Cheryl E. Praeger:
  Homogeneous factorisations of complete multipartite graphs. 415-431
• 
  Sylvain Gravier, Julien Moncel:
  On graphs having a V\{x} set as an identifying code. 432-434
• 
  Sylvain Gravier, Julien Moncel, Charles Payan:
  A generalization of the pentomino exclusion problem: Dislocation of graphs. 435-444
• 
  Branko Grünbaum:
  Graphs of polyhedra; polyhedra as graphs. 445-463
• 
  Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert:
  Fast recognition of classes of almost-median graphs. 464-471
• 
  Wilfried Imrich, Iztok Peterin:
  Recognizing Cartesian products in linear time. 472-483
• 
  Robert Jajcay, Aleksander Malnic, Dragan Marusic:
  On the number of closed walks in vertex-transitive graphs. 484-493
• 
  Matthias Kriesell:
  How to contract an essentially 6-connected graph to a 5-connected graph. 494-510
• 
  Young Soo Kwon, Roman Nedela:
  Non-existence of nonorientable regular embeddings of n-dimensional cubes. 511-516
• 
  Lubica Liskova, Martin Macaj, Martin Skoviera:
  Regular maps from Cayley graphs III: t-balanced Cayley maps. 517-533
• 
  Marko Lovrecic Sarazin, Walter Pacco, Andrea Previtali:
  Generalizing the generalized Petersen graphs. 534-543
• 
  Stefko Miklavic:
  On bipartite Q-polynomial distance-regular graphs with c₂=1. 544-553
• 
  David Orden, Francisco Santos, Brigitte Servatius, Herman Servatius:
  Combinatorial pseudo-triangulations. 554-566
• 
  Tomaz Pisanski:
  A classification of cubic bicirculants. 567-578
• 
  Primoz Potocnik, Mateja Sajna, Gabriel Verret:
  Mobility of vertex-transitive graphs. 579-591
• 
  Marko Razpet:
  The middle row of the principal cell. 592-598
• 
  Jana Siagiová, Mark E. Watkins:
  Covalence sequences of planar vertex-homogeneous maps. 599-614
• 
  Douglas M. Van Wieren:
  Critical cyclic patterns related to the domination number of the torus. 615-632
• 
  Arjana Zitnik:
  Series parallel extensions of plane graphs to dual-eulerian graphs. 633-640
• 
  Blaz Zmazek, Janez Zerovnik:
  Weak reconstruction of strong product graphs. 641-649
• 
  Bojan Mohar, Richard J. Nowakowski, Douglas B. West:
  Research problems from the 5th Slovenian Conference (Bled, 2003). 650-658

Volume 307, Number 6, March 2007

• 
  Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote:
  On the restricted connectivity and superconnectivity in graphs with given girth. 659-667
• 
  Jason Bell, Mark A. Skandera:
  Multicomplexes and polynomials with real zeros. 668-682
• 
  Tamara Burton, David P. Sumner:
  gamma-Excellent, critically dominated, end-dominated, and dot-critical trees are equivalent. 683-693
• 
  Yair Caro, Dieter Rautenbach:
  Reconstructing graphs from size and degree properties of their induced k-subgraphs. 694-703
• 
  Maria Rita Casali:
  Estimating Matveev's complexity via crystallization theory. 704-714
• 
  H. Michael Damm:
  Totally anti-symmetric quasigroups for all orders n =/ 2, 6. 715-729
• 
  Mirko Lepovic:
  On conjugate adjacency matrices of a graph. 730-738
• 
  Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
  Complete arcs in PG(2, 25): The spectrum of the sizes and the classification of the smallest complete arcs. 739-747

Notes

• 
  Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela:
  Counterexample to a conjecture of Györi on C_2l-free bipartite graphs. 748-749
• 
  Dragic Bankovic:
  Boolean inequations. 750-755
• 
  Frank Gurski, Egon Wanke:
  A local characterization of bounded clique-width for line graphs. 756-759
• 
  Yi Ru Huang, Yuandi Wang, Wancheng Sheng, Jian Sheng Yang, Kemin Zhang, Jian Huang:
  New upper bound formulas with parameters for Ramsey numbers. 760-763
• 
  Ken-ichi Kawarabayashi, Atsuhiro Nakamoto:
  The Erdos-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces. 764-768
• 
  Michel Morvan, Eric Rémila, Eric Thierry:
  A note on the structure of spaces of domino tilings. 769-773
• 
  Vladimir Nikiforov:
  Eigenvalue problems of Nordhaus-Gaddum type. 774-780
• 
  Ioan Tomescu:
  On the chromaticity of sunflower hypergraphs SH(n, p, h). 781-786

Volume 307, Numbers 7-8, April 2007

Cycles and Colourings 2003

• 
  Mirko Hornák, Stanislav Jendrol':
  Preface. 787
• 
  Michael D. Plummer:
  Graph factors and factorization: 1985-2003: A survey. 791-821
• 
  Gábor Bacsó, Zsolt Tuza, Margit Voigt:
  Characterization of graphs dominated by induced paths. 822-826
• 
  Halina Bielak:
  Relations between 2-local and 2-mean Ramsey numbers for graphs. 827-831
• 
  Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto:
  Toughness and hamiltonicity in k-trees. 832-838
• 
  Frank Bullock, Marietjie Frick, Gabriel Semanisin, Róbert Vlacuha:
  Nontraceable detour graphs. 839-853
• 
  Igor Fabrici, Tomás Madaras:
  The structure of 1-planar graphs. 854-865
• 
  Igor Fabrici:
  Light graphs in families of outerplanar graphs. 866-872
• 
  Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer:
  Degree conditions for hamiltonicity: Counting the number of missing edges. 873-877
• 
  Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
  A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs. 878-884
• 
  Marietjie Frick, Joy Singleton:
  Cubic maximal nontraceable graphs. 885-891
• 
  Tobias Gerlach, Jochen Harant:
  On a cycle through a specified linear forest of a graph. 892-895
• 
  Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
  A note on decompositions of transitive tournaments. 896-904
• 
  Erhard Hexel:
  On short paths through prescribed vertices of a graph. 905-910
• 
  Bill Jackson, G. Sethuraman, Carol A. Whitehead:
  A note on the Erdos-Farber-Lovász conjecture. 911-915
• 
  Arnfried Kemnitz, Massimiliano Marangio, Peter Mihók:
  [r, s, t]-Chromatic numbers and hereditary properties of graphs. 916-922
• 
  Daniel Král:
  Mixed hypergraphs and other coloring problems. 923-938
• 
  Tomás Madaras, Riste Skrekovski:
  Lightness, heaviness and gravity. 939-951
• 
  Danuta Michalak:
  Hereditarily dominated graphs. 952-957
• 
  Peter Mihók, Gabriel Semanisin:
  On invariants of hereditary graph properties. 958-963
• 
  Minh Hoang Nguyen, Mirka Miller, Joan Gimbert:
  On mixed Moore graphs. 964-970
• 
  Monika Pilsniak:
  Packing of two digraphs into a transitive tournament. 971-974
• 
  A. N. M. Salman, Hajo Broersma:
  On Ramsey numbers for paths versus wheels. 975-982
• 
  Jens Schreyer:
  Almost every graph is vertex-oblique. 983-989
• 
  Zdzislaw Skupien:
  BCH codes and distance multi- or fractional colorings in hypercubes asymptotically. 990-1000
• 
  Milan Tuhársky:
  Light stars in large polyhedral maps on surfaces. 1001-1012
• 
  Margit Voigt:
  A non-3-choosable planar graph without cycles of length 4 and 5. 1013-1015
• 
  Maciej Zwierzchowski:
  Total domination number of the conjunction of graphs. 1016-1020

Volume 307, Numbers 9-10, May 2007

• 
  Davide Baccherini, Donatella Merlini, Renzo Sprugnoli:
  Binary words excluding a pattern and proper Riordan arrays. 1021-1037
• 
  Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez:
  New exact values of the maximum size of graphs free of topological complete subgraphs. 1038-1046
• 
  T. C. Edwin Cheng, Yaojun Chen, Yunqing Zhang, C. T. Ng:
  The Ramsey numbers for a cycle of length six or seven versus a clique of order seven. 1047-1053
• 
  Peter Couperus:
  Circulant covers of trivalent circulants. 1054-1064
• 
  Murilo Vicente Gonçalves da Silva, Kristina Vuskovic:
  Triangulated neighborhoods in even-hole-free graphs. 1065-1073
• 
  Michelle R. DeDeo, Dominic Lanphier, Marvin Minei:
  The spectrum of Platonic graphs over finite fields. 1074-1081
• 
  Arturas Dubickas:
  On a sequence related to that of Thue-Morse and its applications. 1082-1093
• 
  Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Cliff Smyth:
  Codes identifying sets of vertices in random networks. 1094-1107
• 
  Ronald J. Gould, John R. Schmitt:
  Minimum degree and the minimum size of K₂²-saturated graphs. 1108-1114
• 
  Michael A. Henning, Preben D. Vestergaard:
  Domination in partitioned graphs with minimum degree two. 1115-1135
• 
  S. S. Kamath, R. S. Bhat:
  On strong (weak) independent sets and vertex coverings of a graph. 1136-1145
• 
  Esamel M. Paluga, Sergio R. Canoy Jr.:
  Monophonic numbers of the join and composition of connected graphs. 1146-1154
• 
  Shane P. Redmond:
  On zero-divisor graphs of small finite commutative rings. 1155-1166
• 
  Jian-Hua Yin, Jiong-Sheng Li:
  Potentially K_{r1, r2, ..., rl, r, s}-graphic sequences. 1167-1177

Notes

• 
  Xinhui An, Baoyindureng Wu:
  Hamiltonicity of complements of middle graphs. 1178-1184
• 
  George E. Andrews, James A. Sellers:
  On Sloane's generalization of non-squashing stacks of boxes. 1185-1190
• 
  Anthony B. Evans:
  Representations of disjoint unions of complete graphs. 1191-1198
• 
  Vladimir Gurvich:
  On the misere version of game Euclid and miserable games. 1199-1204
• 
  Mingchu Li, Cheng Guo, Liming Xiong, Dengxin Li, Hong-Jian Lai:
  Quadrangularly connected claw-free graphs. 1205-1211
• 
  Frédéric Maffray, Dieter Rautenbach:
  Small step-dominating sets in trees. 1212-1215

Errata

• 
  Hong-Jian Lai, Xiangjuan Yao:
  Erratum to "Collapsible biclaw-free graphs": [Discrete Math 306 (2006) 2115-2117]. 1217
• 
  Simon R. Blackburn, Igor E. Shparlinski:
  Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]. 1218-1219

Volume 307, Numbers 11-12, May 2007

The Fourth Caracow Conference on Graph Theory - Czorsztyn 2002

• 
  Rafal Kalinowski, Mariusz Meszka:
  Preface. 1221-1222
•