Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices

In this paper we present a polynomial time algorithm that determines if an input graph containing no induced seven-vertex path is 3-colorable. This affirmatively answers a question posed by Randerath, Schiermeyer and Tewes in 2002. Our algorithm also solves the list-coloring version of the 3-colorin...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Combinatorica (Budapest. 1981) Jg. 38; H. 4; S. 779 - 801
Hauptverfasser:	Bonomo, Flavia, Chudnovsky, Maria, Maceli, Peter, Schaudt, Oliver, Stein, Maya, Zhong, Mingxian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2018 Springer Springer Nature B.V
Schlagworte:	Algorithms Coloring Combinatorics Graph algorithms Mathematics Mathematics and Statistics Set theory 05C85 05C15 05C37
ISSN:	0209-9683, 1439-6912
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!