Discrete Mathematics, Volume 286
Volume 286, Number 1-2, September 2004
- Mohamed El Kadi Abderrezzak, Evelyne Flandrin: New sufficient conditions for bipancyclic bipartite graphs. 5-13
- 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
- Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt, Peter Mihók: Minimal vertex Ramsey graphs and minimal forbidden subgraphs. 31-36
- Roman Cada, Tomás Kaiser, Moshe Rosenfeld, Zdenek Ryjácek: Hamiltonian decompositions of prisms over cubic graphs. 45-56
- Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak: A note on pancyclism of highly connected graphs. 57-60
- T. Gerlach: Toughness and Hamiltonicity of a class of planar graphs. 61-65
- Frank Göring, Jochen Harant, Erhard Hexel, Zsolt Tuza: On short cycles through prescribed vertices of a graph. 67-74
- Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo: A note on embedding graphs without short cycles. 75-77
- Joanna Górska, Zdzislaw Skupien, Zofia Majcher, Jerzy Michael: A smallest irregular oriented graph containing a given diregular one. 79-88
- Jochen Harant: On paths and cycles through specified vertices. 95-98
- Antoni Marczyk: On the structure of the set of cycle lengths in a hamiltonian graph. 133-140
- Danuta Michalak: Domination, independence and irredundance with respect to additive induced-hereditary properties. 141-146
- Ladislav Nebesky: Intervals and steps in a connected graph. 151-156
- Ingo Schiermeyer: Rainbow numbers for matchings and complete graphs. 157-162
- Gabriel Semanisin: Minimal reducible bounds for induced-hereditary properties. 163-170
Volume 286, Number 3, September 2004
- Philip A. Sinclair: Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph. 171-175
- Philip A. Sinclair: On removable even circuits in graphs. 177-184
- Teresa W. Haynes, Michael A. Henning, Lora Hopkins: Total domination subdivision numbers of trees. 195-202
- Rumen N. Daskalov, Elena Metodieva: The nonexistence of ternary [105, 6, 68] and [230, 6, 152] codes. 225-232
- Mohamed El Haddad, Yannis Manoussakis, Rachid Saad: Upper bounds for the forwarding indices of communication networks. 233-240
- Randall J. Elzinga, David A. Gregory, Kevin N. Vander Meulen: Addressing the Petersen graph. 241-244
- Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito: Toughness, degrees and 2-factors. 245-249
- Roderick J. Fletcher, Christos Koukouvinos, Jennifer Seberry: New skew-Hadamard matrices of order 4cdot59 and new D-optimal designs of order 2cdot59. 251-253
- Wayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe: The diameter of total domination vertex critical graphs. 255-261
- Karl Mahlburg: The overpartition function modulo small powers of 2. 263-267
- Rekha Natarajan: A bijection between certain non-crossing partitions and sequences. 269-275
- Jörn Quistorff: Slight improvements of the Singleton bound. 277-283
- Feng Tian: A short proof of Fan's theorem. 285-286
- Mauro Zannetti: (q2+q+1)-caps of class [0, 1, 2, 3, q+1]2 and type (1, m, n)4 of PG(5, q) are quadric Veroneseans. 287-290
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team