Discrete Mathematics, Volume 191

Volume 191, Numbers 1-3, September 1998

• Horst Sachs:
  Preface. 1-2
  Electronic Edition (link) BibTeX
• Thomas Andreae:
  On the clique-transversal number of chordal graphs. 3-11
  Electronic Edition (link) BibTeX
• Luitpold Babel:
  Tree-like P₄-connected graphs. 13-23
  Electronic Edition (link) BibTeX
• Thomas Böhme, Jochen Harant:
  On Hamiltonian cycles in 4- and 5-connected plane triangulations. 25-30
  Electronic Edition (link) BibTeX
• Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer:
  A planarity criterion for cubic bipartite graphs. 31-43
  Electronic Edition (link) BibTeX
• Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
  On kernel-perfect orientations of line graphs. 45-49
  Electronic Edition (link) BibTeX
• Mieczyslaw Borowiecki, Danuta Michalak:
  Generalized independence and domination in graphs. 51-56
  Electronic Edition (link) BibTeX
• Jan Brousek:
  Minimal 2-connected non-hamiltonian claw-free graphs. 57-64
  Electronic Edition (link) BibTeX
• Guantao Chen, András Gyárfás, Richard H. Schelp:
  Vertex colorings with a distance restriction. 65-82
  Electronic Edition (link) BibTeX
• Igor Fabrici, Stanislav Jendrol:
  Subgraphs with restricted degrees of their vertices in planar graphs. 83-90
  Electronic Edition (link) BibTeX
• Harald Gropp:
  On configurations and the book of Sainte-Laguë. 91-99
  Electronic Edition (link) BibTeX
• Gregory Gutin, Benny Sudakov, Anders Yeo:
  Note on alternating directed cycles. 101-107
  Electronic Edition (link) BibTeX
• Heiko Harborth:
  Empty triangles in drawings of the complete graph. 109-111
  Electronic Edition (link) BibTeX
• Arnfried Kemnitz, Halka Kolberg:
  Coloring of integer distance graphs. 113-123
  Electronic Edition (link) BibTeX
• Alexandr V. Kostochka, Michael Stiebitz:
  Colour-critical graphs with few edges. 125-137
  Electronic Edition (link) BibTeX
• Jan Kratochvíl, Zsolt Tuza, Margit Voigt:
  Complexity of choosing subsets from color sets. 139-148
  Electronic Edition (link) BibTeX
• Peter Mihók, Jozef Bucko, Margit Voigt:
  On uniquely partitionable planar graphs. 149-158
  Electronic Edition (link) BibTeX
• Bert Randerath, Lutz Volkmann:
  Characterization of graphs with equal domination and covering number. 159-169
  Electronic Edition (link) BibTeX
• Zdenek Ryjácek, Ingo Schiermeyer:
  2-factors and hamiltonicity. 171-177
  Electronic Edition (link) BibTeX
• Annette Schelten, Uwe Schelten:
  Neighborhood conditions for graphs with induced claws. 179-189
  Electronic Edition (link) BibTeX
• Annette Schelten, Ingo Schiermeyer:
  Ramsey numbers r(K₃, G) for G =~ K₇ - 2P₂ and G =~ K₇ - 3P₂. 191-196
  Electronic Edition (link) BibTeX
• Peter Smutný, Michal Tkác:
  On cubic polyhedral graphs with prescribed adjacency properties of their faces. 197-206
  Electronic Edition (link) BibTeX
• Jerzy Topp, Preben D. Vestergaard:
  Interpolation theorems for domination numbers of a graph. 207-221
  Electronic Edition (link) BibTeX
• Heinz-Jürgen Voss:
  Sachs triangulations and infinite sequences of regular maps on given type. 223-240
  Electronic Edition (link) BibTeX
• Walter Wessel:
  A short solution of Heawood's empire problem in the plane. 241-245
  Electronic Edition (link) BibTeX