Chromatic index critical graphs and multigraphs

Grünewald S (01T00:00:00Z.01.1970)
Bielefeld (Germany): Bielefeld University.

Bielefelder E-Dissertation | Englisch
 
Download
OA
Autor/in
Betreuer
Abstract / Bemerkung
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.
Stichworte
Graph , Multigraph , Graphfärbung , Graphentheorie , Kantenfärbung , Edge coloring , Critical graph conjecture , Planar graph conjecture
Jahr
2000
Page URI
https://pub.uni-bielefeld.de/record/2303675

Zitieren

Grünewald S. Chromatic index critical graphs and multigraphs. Bielefeld (Germany): Bielefeld University; 2000.
Grünewald, S. (01T00:00:00Z.01.1970). Chromatic index critical graphs and multigraphs. Bielefeld (Germany): Bielefeld University.
Grünewald, S. 01T00:00:00Z.01.1970 Chromatic index critical graphs and multigraphs. Bielefeld (Germany): Bielefeld University.
Grünewald, S., 01T00:00:00Z.01.1970 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.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Volltext(e)
Access Level
OA Open Access
Zuletzt Hochgeladen
2019-09-06T08:57:43Z
MD5 Prüfsumme
022c72486cfdcdcb62e1889838732b97

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar