Chromatic index critical graphs and multigraphs

Grünewald S (2000)
Bielefeld (Germany): Bielefeld University.

Download
OA
Bielefeld Dissertation | English
Author
Supervisor
Steffen, Eckhard (PD Dr.)
Abstract
We consider graphs and multigraphs which are critical with respect to the chromatic index. In chapter 3, we give a construction of critical multigraphs with exactly 20 vertices and maximum degree k for every k>=5. This disproves the weak critical graph conjecture. In chapter 4, we give a new method, how several 4-critical multigraphs can be constructed from a given 3-critical graph. In chapter 5, we prove that the edges of every planar graph with maximum degree 7 can be colored with 7 colors. This proves one of the two open cases of Vizing's planar graph conjecture from 1965.
Year
PUB-ID

Cite this

Grünewald S. Chromatic index critical graphs and multigraphs. Bielefeld (Germany): Bielefeld University; 2000.
Grünewald, S. (2000). Chromatic index critical graphs and multigraphs. Bielefeld (Germany): Bielefeld University.
Grünewald, S. (2000). Chromatic index critical graphs and multigraphs. Bielefeld (Germany): Bielefeld University.
Grünewald, S., 2000. Chromatic index critical graphs and multigraphs, Bielefeld (Germany): Bielefeld University.
S. Grünewald, Chromatic index critical graphs and multigraphs, Bielefeld (Germany): Bielefeld University, 2000.
Grünewald, S.: Chromatic index critical graphs and multigraphs. Bielefeld University, Bielefeld (Germany) (2000).
Grünewald, Stefan. Chromatic index critical graphs and multigraphs. Bielefeld (Germany): Bielefeld University, 2000.
Main File(s)
File Name
Access Level
OA Open Access

This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar