Colorful graph coloring

DOI10.1007/978-3-031-20796-9_11zbMath1528.68331MaRDI QIDQ6166878

Jiong Guo, Zhongyi Zhang

Publication date: 3 August 2023

Published in: Frontiers of Algorithmic Wisdom (Search for Journal in Brave)

zbMATH Keywords

graph coloringNP-hardnessparameterized algorithmsabsolute approximation

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) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Graph Theory
• On the hardness of approximating minimization problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Colorful graph coloring