Polynomial graph-colorings

DOI10.1007/BFb0028977zbMath1492.68063OpenAlexW1539999544MaRDI QIDQ5096147

Wolfgang Gutjahr, Gerhard J. Woeginger, Ermo Welzl

Publication date: 16 August 2022

Published in: STACS 89 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0028977

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Colorings and interpretations: a connection between graphs and grammar forms
• The Complexity of Colouring by Semicomplete Digraphs
• On the complexity of the general coloring problem
• The NP-completeness column: An ongoing guide

This page was built for publication: Polynomial graph-colorings