scientific article; zbMATH DE number 1953083

zbMATH Open1024.05024MaRDI QIDQ4414486FDOQ4414486

Authors: Fedor V. Fomin, J. Nešetřil, Gerhard J. Woeginger, Hajo Broersma 

Publication date: 25 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2573/25730068.htm

Title of this publication is not available (Why is that?)

Recommendations

• More about subcolorings
• scientific article; zbMATH DE number 2044932
• Graph Subcolorings: Complexity and Algorithms
• On 2-Subcolourings of Chordal Graphs
• 2-subcoloring is NP-complete for planar comparability graphs

zbMATH Keywords

computational complexitygraph coloringpolynomial time algorithmspecial graph classessubcoloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• More about subcolorings
• On the algorithmic aspects of strong subcoloring
• Graph Subcolorings: Complexity and Algorithms
• 2-subcoloring is NP-complete for planar comparability graphs
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414486)