Discrete Mathematics, Volume 101

Volume 101, Numbers 1-3, May 1992

• Kathie Cameron, Jack Edmonds:
  Coflow polyhedra. 1-21
  Electronic Edition (link) BibTeX
• Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau:
  Extremal problems involving vertices and edges on odd cycles. 23-31
  Electronic Edition (link) BibTeX
• Herbert Fleischner:
  Spanning eularian subgraphs, the splitting Lemma, and Petersen's theorem. 33-37
  Electronic Edition (link) BibTeX
• Herbert Fleischner, Michael Stiebitz:
  A solution to a colouring problem of P. Erdös. 39-48
  Electronic Edition (link) BibTeX
• András Frank:
  On a theorem of Mader. 49-57
  Electronic Edition (link) BibTeX
• Zoltán Füredi:
  Indecomposable regular graphs and hypergraphs. 59-64
  Electronic Edition (link) BibTeX
• Jerrold R. Griggs, Joan P. Hutchinson:
  On the r-domination number of a graph. 65-72
  Electronic Edition (link) BibTeX
• Harald Gropp:
  Enumeration of regular graphs 100 years ago. 73-85
  Electronic Edition (link) BibTeX
• Ervin Györi, Michael D. Plummer:
  The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. 87-96
  Electronic Edition (link) BibTeX
• R. Halin:
  Some finiteness results concerning separation in graphs. 97-106
  Electronic Edition (link) BibTeX
• Denis Hanson:
  A quick proof that K₁₀ != P + P + P. 107-108
  Electronic Edition (link) BibTeX
• Denis Hanson, Ping Wang, Leif K. Jørgensen:
  On cages with given degree sets. 109-114
  Electronic Edition (link) BibTeX
• Robert L. Hemminger, Xingxing Yu:
  On 3-connected graphs with contractible edge covers of size k. 115-133
  Electronic Edition (link) BibTeX
• Anthony J. W. Hilton, Zhao Cheng:
  The chromatic index of a graph whose core has maximum degree two. 135-147
  Electronic Edition (link) BibTeX
• François Jaeger:
  A new invariant of plane bipartite cubic graphs. 149-164
  Electronic Edition (link) BibTeX
• Hal A. Kierstead, William T. Trotter:
  Colorful induced subgraphs. 165-169
  Electronic Edition (link) BibTeX
• William Kocay:
  An extension of the multi-path algorithm for finding hamilton cycles. 171-188
  Electronic Edition (link) BibTeX
• Alexandr V. Kostochka:
  List edge chromatic number of graphs with large girth. 189-201
  Electronic Edition (link) BibTeX
• Daphne Der-Fen Liu:
  T-colorings of graphs. 203-212
  Electronic Edition (link) BibTeX
• Jean Mayer:
  Conjecture de Hadwiger: k = 6. II - réductions de sommets de degré 6 dans les graphes 6- chromatiques contraction-critiques. 213-222
  Electronic Edition (link) BibTeX
• Jaroslav Nesetril, Vojtech Rödl:
  On Ramsey graphs without bipartite subgraphs. 223-229
  Electronic Edition (link) BibTeX
• K. B. Reid, Weizhen Gu:
  Plurality preference digraphs realized by trees, II: on realization numbers. 231-249
  Electronic Edition (link) BibTeX
• Gert Sabidussi:
  Binary invariants and orientations of graphs. 251-277
  Electronic Edition (link) BibTeX
• Horst Sachs:
  How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs. 279-284
  Electronic Edition (link) BibTeX
• Akira Saito:
  Cycles of length 2 modulo 3 in graphs. 285-289
  Electronic Edition (link) BibTeX
• Karen Seyffarth:
  Hajós' conjecture and small cycle double covers of planar graphs. 291-306
  Electronic Edition (link) BibTeX
• Michael Stiebitz:
  On Hadwiger's number - a problem of the Nordhaus-Gaddum type. 307-317
  Electronic Edition (link) BibTeX
• Henk Jan Veldman:
  Cycles containing many vertices of large degree. 319-325
  Electronic Edition (link) BibTeX
• Douglas R. Woodall:
  An inequality for chromatic polynomials. 327-331
  Electronic Edition (link) BibTeX
• Douglas R. Woodall:
  A zero-free interval for chromatic polynomials. 333-341
  Electronic Edition (link) BibTeX
• D. A. Youngs:
  Gallai's problem on Dirac's construction. 343-350
  Electronic Edition (link) BibTeX
• Jørgen Bang-Jensen, Bjarne Toft:
  Unsolved problems presented at the Julius Petersen Graph Theory Conference. 351-360
  Electronic Edition (link) BibTeX