Colouring vertices of triangle-free graphs without forests
- Dabrowski, Konrad K. University of Warwick, UK
- Lozin, Vadim University of Warwick, UK
- Raman, Rajiv University of Warwick, UK
- Ries, Bernard Université Paris-Dauphine, France
-
2012
Published in:
- Discrete Mathematics. - 2012, vol. 312, no. 7, p. 1372-1385
English
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it is NP-complete in any subclass of triangle-free graphs defined by a finite collection of forbidden induced subgraphs, each of which contains a cycle. In this paper, we study the vertex colouring problem in subclasses of triangle-free graphs obtained by forbidding graphs without cycles, i.e., forests, and prove polynomial-time solvability of the problem in many classes of this type. In particular, our paper, combined with some previously known results, provides a complete description of the complexity status of the problem in subclasses of triangle-free graphs obtained by forbidding a forest with at most 6 vertices.
- Faculty
- Faculté des sciences économiques et sociales et du management
- Department
- Département d'informatique
- Language
-
- English
- Classification
- Computer science and technology
- License
- License undefined
- Identifiers
-
- RERO DOC 328806
- DOI 10.1016/j.disc.2011.12.012
- Persistent URL
- https://folia.unifr.ch/unifr/documents/308570
Statistics
Document views: 55
File downloads:
- triangle-free.pdf: 83