On the approximation of Min Split-coloring and Min Cocoloring

DOI10.7155/jgaa.00129zbMath1161.68652OpenAlexW2101734619MaRDI QIDQ5301394

Tınaz Ekim, Marc Demange, Dominique de Werra

Publication date: 19 January 2009

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/55401

zbMATH Keywords

NP-hardnessMin Split-coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Fixed-parameter algorithms for the cocoloring problem ⋮ A tutorial on the use of graph coloring for some problems in robotics ⋮ Partitioning graphs into complete and empty graphs

This page was built for publication: On the approximation of Min Split-coloring and Min Cocoloring