scientific article; zbMATH DE number 1953083

zbMath1024.05024MaRDI QIDQ4414486

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

Publication date: 25 July 2003

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitygraph coloringpolynomial time algorithmspecial graph classessubcoloring

Mathematics Subject Classification ID

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