• 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

A note on the NP-completeness of the precoloring extension coloring problem in triangle free planar graphs

Monnot, Jérôme (2006), A note on the NP-completeness of the precoloring extension coloring problem in triangle free planar graphs, Foundations of Computing and Decision Sciences, 31, 2, p. 169-174

Type
Article accepté pour publication ou publié
Date
2006
Journal name
Foundations of Computing and Decision Sciences
Volume
31
Number
2
Publisher
Poznań University of Technology
Pages
169-174
Metadata
Show full item record
Author(s)
Monnot, Jérôme cc
Abstract (EN)
The precoloring extension coloring problem consists in deciding, given a positive integer k, a graph G = (V, E) and k pairwise disjoint subsets V0,...,Vk-1 of V, if there exists a (vertex) coloring S = (S0,...,Sk-1) of G such that Vi ⊆ Si, for all i = 0,…, k - 1. In this note, we show that the precoloring extension coloring problem is NP-complete in triangle free planar graphs with maximum degree 4.
Subjects / Keywords
Optimisation combinatoire

Related items

Showing items related by title and author.

  • Thumbnail
    On the complexity of the selective graph coloring problem in some special classes of graphs 
    Ries, Bernard; Pop, Petrica; Monnot, Jérôme; Demange, Marc (2014) Article accepté pour publication ou publié
  • Thumbnail
    On the NP-completeness of the perfect matching free subgraph problem 
    Lacroix, Mathieu; Mahjoub, Ali Ridha; Martin, Sébastien; Picouleau, Christophe (2012) Article accepté pour publication ou publié
  • Thumbnail
    A note on the hardness results for the labeled perfect matching problems in bipartite graphs 
    Monnot, Jérôme (2008) Article accepté pour publication ou publié
  • Thumbnail
    A note on the hardness results for the labeled perfect matching problems in bipartite graphs 
    Monnot, Jérôme (2007) Document de travail / Working paper
  • Thumbnail
    Selective Graph Coloring in Some Special Classes of Graphs 
    Ries, Bernard; Pop, Petrica; Monnot, Jérôme; Demange, Marc (2012) Communication / Conférence
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