Date
2010
Titre de la collection
Lecture Notes in Computer Science
n° dans la collection
6410
Indexation documentaire
Principes généraux des mathématiques
Subject
Vertex colouring; Triangle-free graphs; Polynomial-time algorithm; Clique-width
Titre du colloque
Graph Theoretic Concepts in Computer Science 36th International Workshop
Date du colloque
06-2010
Ville du colloque
Zaros
Pays du colloque
Grèce
Titre de l'ouvrage
Graph Theoretic Concepts in Computer Science
36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers
Auteur
Thilikos, Dimitrios M.
Nom de l'éditeur
Springer
Ville de l'éditeur
Berlin
Année
2010
Nombre total de pages
338
ISBN
978-3-642-16925-0
Auteur
Lozin, Vadim
Raman, Rajiv
Ries, Bernard
Dabrowski, Konrad
Type
Communication / Conférence
Nombre de pages du document
184-195
Résumé en anglais
The vertex colouring problem is known to be NP-comple-te in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is not a forest. We study the computational complexity of the problem in (K3,F)-free graphs with F being a forest. From known results it follows that for any forest F on 5 vertices the vertex colouring problem is polynomial-time solvable in the class of (K3,F)-free graphs. In the present paper, we show that the problem is also polynomial-time solvable in many classes of (K3,F)-free graphs with F being a forest on 6 vertices.
