


default search action
Discrete Mathematics, Volume 191
Volume 191, Numbers 1-3, September 1998
- Horst Sachs:

Preface. 1-2 - Thomas Andreae:

On the clique-transversal number of chordal graphs. 3-11 - Luitpold Babel:

Tree-like P4-connected graphs. 13-23 - Thomas Böhme, Jochen Harant:

On Hamiltonian cycles in 4- and 5-connected plane triangulations. 25-30 - Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer:

A planarity criterion for cubic bipartite graphs. 31-43 - Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:

On kernel-perfect orientations of line graphs. 45-49 - Mieczyslaw Borowiecki, Danuta Michalak:

Generalized independence and domination in graphs. 51-56 - Jan Brousek:

Minimal 2-connected non-hamiltonian claw-free graphs. 57-64 - Guantao Chen, András Gyárfás, Richard H. Schelp:

Vertex colorings with a distance restriction. 65-82 - Igor Fabrici

, Stanislav Jendrol'
:
Subgraphs with restricted degrees of their vertices in planar graphs. 83-90 - Harald Gropp:

On configurations and the book of Sainte-Laguë. 91-99 - Gregory Z. Gutin, Benny Sudakov, Anders Yeo:

Note on alternating directed cycles. 101-107 - Heiko Harborth:

Empty triangles in drawings of the complete graph. 109-111 - Arnfried Kemnitz, Halka Kolberg:

Coloring of integer distance graphs. 113-123 - Alexandr V. Kostochka, Michael Stiebitz:

Colour-critical graphs with few edges. 125-137 - Jan Kratochvíl

, Zsolt Tuza, Margit Voigt:
Complexity of choosing subsets from color sets. 139-148 - Peter Mihók, Jozef Bucko, Margit Voigt:

On uniquely partitionable planar graphs. 149-158 - Bert Randerath, Lutz Volkmann:

Characterization of graphs with equal domination and covering number. 159-169 - Zdenek Ryjácek, Ingo Schiermeyer:

2-factors and hamiltonicity. 171-177 - Annette Schelten, Uwe Schelten:

Neighborhood conditions for graphs with induced claws. 179-189 - Annette Schelten, Ingo Schiermeyer:

Ramsey numbers r(K3, G) for G =~ K7 - 2P2 and G =~ K7 - 3P2. 191-196 - Peter Smutný, Michal Tkác

:
On cubic polyhedral graphs with prescribed adjacency properties of their faces. 197-206 - Jerzy Topp

, Preben D. Vestergaard:
Interpolation theorems for domination numbers of a graph. 207-221 - Heinz-Jürgen Voss:

Sachs triangulations and infinite sequences of regular maps on given type. 223-240 - Walter Wessel:

A short solution of Heawood's empire problem in the plane. 241-245

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














