Discrete Mathematics, Volume 286

Volume 286, Number 1-2, September 2004

Cycles and Colourings

Mirko Hornák, Stanislav Jendrol:
Preface. 1-
Electronic Edition (link) BibTeX
Mohamed El Kadi Abderrezzak, Evelyne Flandrin:
New sufficient conditions for bipancyclic bipartite graphs. 5-13
Electronic Edition (link) BibTeX
Krystyna T. Balinska, Slobodan K. Simic, Krzysztof T. Zwierzyski:
Which non-regular bipartite integral graphs with maximum degree four do not have pm1 as eigenvalues? 15-24
Electronic Edition (link) BibTeX
James Boland, Fred Buckley, Mirka Miller:
Eccentric digraphs. 25-29
Electronic Edition (link) BibTeX
Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt, Peter Mihók:
Minimal vertex Ramsey graphs and minimal forbidden subgraphs. 31-36
Electronic Edition (link) BibTeX
Mieczyslaw Borowiecki, Mariusz Haluszczak, Elzbieta Sidorowicz:
On Ramsey minimal graphs. 37-43
Electronic Edition (link) BibTeX
Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek:
Hamiltonian decompositions of prisms over cubic graphs. 45-56
Electronic Edition (link) BibTeX
Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak:
A note on pancyclism of highly connected graphs. 57-60
Electronic Edition (link) BibTeX
T. Gerlach:
Toughness and Hamiltonicity of a class of planar graphs. 61-65
Electronic Edition (link) BibTeX
Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza:
On short cycles through prescribed vertices of a graph. 67-74
Electronic Edition (link) BibTeX
Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
A note on embedding graphs without short cycles. 75-77
Electronic Edition (link) BibTeX
Joanna Górska, Zdzislaw Skupien, Zofia Majcher, Jerzy Michael:
A smallest irregular oriented graph containing a given diregular one. 79-88
Electronic Edition (link) BibTeX
Andrea Hackmann, Arnfried Kemnitz:
The circular chromatic index. 89-93
Electronic Edition (link) BibTeX
Jochen Harant:
On paths and cycles through specified vertices. 95-98
Electronic Edition (link) BibTeX
Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss:
Mixed hypercacti. 99-113
Electronic Edition (link) BibTeX
Tomás Madaras, Riste Skrekovski:
Heavy paths, light stars, and big melons. 115-131
Electronic Edition (link) BibTeX
Antoni Marczyk:
On the structure of the set of cycle lengths in a hamiltonian graph. 133-140
Electronic Edition (link) BibTeX
Danuta Michalak:
Domination, independence and irredundance with respect to additive induced-hereditary properties. 141-146
Electronic Edition (link) BibTeX
Peter Mihók, Ingo Schiermeyer:
Cycle lengths and chromatic number of graphs. 147-149
Electronic Edition (link) BibTeX
Ladislav Nebesky:
Intervals and steps in a connected graph. 151-156
Electronic Edition (link) BibTeX
Ingo Schiermeyer:
Rainbow numbers for matchings and complete graphs. 157-162
Electronic Edition (link) BibTeX
Gabriel Semanisin:
Minimal reducible bounds for induced-hereditary properties. 163-170
Electronic Edition (link) BibTeX

Volume 286, Number 3, September 2004

Article

Philip A. Sinclair:
Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph. 171-175
Electronic Edition (link) BibTeX
Philip A. Sinclair:
On removable even circuits in graphs. 177-184
Electronic Edition (link) BibTeX
Manoj Changat, Joseph Mathew:
Induced path transit function, monotone and Peano axioms. 185-194
Electronic Edition (link) BibTeX
Teresa W. Haynes, Michael A. Henning, Lora Hopkins:
Total domination subdivision numbers of trees. 195-202
Electronic Edition (link) BibTeX
Michael A. Henning, Jacob Elgin Maritz:
Stratification and domination in graphs II. 203-211
Electronic Edition (link) BibTeX

Short Communication

Camino Balbuena, Pedro García-Vázquez:
Edge-connectivity in P_k-path graphs. 213-218
Electronic Edition (link) BibTeX
Andrzej Czygrinow, Brendan Nagle:
Strong edge colorings of uniform graphs. 219-223
Electronic Edition (link) BibTeX
Rumen N. Daskalov, Elena Metodieva:
The nonexistence of ternary [105, 6, 68] and [230, 6, 152] codes. 225-232
Electronic Edition (link) BibTeX
Mohamed El Haddad, Yannis Manoussakis, Rachid Saad:
Upper bounds for the forwarding indices of communication networks. 233-240
Electronic Edition (link) BibTeX
Randall J. Elzinga, David A. Gregory, Kevin N. Vander Meulen:
Addressing the Petersen graph. 241-244
Electronic Edition (link) BibTeX
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito:
Toughness, degrees and 2-factors. 245-249
Electronic Edition (link) BibTeX
Roderick J. Fletcher, Christos Koukouvinos, Jennifer Seberry:
New skew-Hadamard matrices of order 4cdot59 and new D-optimal designs of order 2cdot59. 251-253
Electronic Edition (link) BibTeX
Wayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
The diameter of total domination vertex critical graphs. 255-261
Electronic Edition (link) BibTeX
Karl Mahlburg:
The overpartition function modulo small powers of 2. 263-267
Electronic Edition (link) BibTeX
Rekha Natarajan:
A bijection between certain non-crossing partitions and sequences. 269-275
Electronic Edition (link) BibTeX
Jörn Quistorff:
Slight improvements of the Singleton bound. 277-283
Electronic Edition (link) BibTeX
Feng Tian:
A short proof of Fan's theorem. 285-286
Electronic Edition (link) BibTeX
Mauro Zannetti:
(q²+q+1)-caps of class [0, 1, 2, 3, q+1]₂ and type (1, m, n)₄ of PG(5, q) are quadric Veroneseans. 287-290
Electronic Edition (link) BibTeX