• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Colouring vertices of triangle-free graphs without forests

Ries, Bernard; Raman, Rajiv; Lozin, Vadim; Dabrowski, Konrad Kazimierz (2012), Colouring vertices of triangle-free graphs without forests, Discrete Mathematics, 312, 7, p. 1372-1385. 10.1016/j.disc.2011.12.012

Type
Article accepté pour publication ou publié
Date
2012
Journal name
Discrete Mathematics
Volume
312
Number
7
Publisher
Elsevier
Pages
1372-1385
Publication identifier
10.1016/j.disc.2011.12.012
Metadata
Show full item record
Author(s)
Ries, Bernard
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Raman, Rajiv

Lozin, Vadim

Dabrowski, Konrad Kazimierz
Abstract (EN)
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.
Subjects / Keywords
Clique-width; Polynomial-time algorithm; Triangle-free graphs; Vertex colouring

Related items

Showing items related by title and author.

  • Thumbnail
    Colouring vertices of triangle-free graphs 
    Lozin, Vadim; Raman, Rajiv; Ries, Bernard; Dabrowski, Konrad Kazimierz (2010) Communication / Conférence
  • Thumbnail
    On the maximum independent set problem in subclasses of subcubic graphs 
    Ries, Bernard; Monnot, Jérôme; Lozin, Vadim (2015) Article accepté pour publication ou publié
  • Thumbnail
    On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs 
    Lozin, Vadim; Monnot, Jérôme; Ries, Bernard (2013) Communication / Conférence
  • Thumbnail
    Critical vertices and edges in H-free graphs 
    Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard (2019) Article accepté pour publication ou publié
  • Thumbnail
    Upper Domination: Towards a Dichotomy Through Boundary Properties 
    AbouEisha, Hassan; Hussain, Shahid; Lozin, Vadim; Monnot, Jérôme; Ries, Bernard; Zamaraev, Viktor (2018) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo