The Complexity of Minimum Convex Coloring

DOI10.1007/978-3-540-92182-0_5zbMath1183.68745OpenAlexW1749053603MaRDI QIDQ3596703

Frank Kammer, Torsten Tholey

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_5

zbMATH Keywords

convex coloringmaximum disjoint paths problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)

Related Items (5)

The complexity of minimum convex coloring ⋮ Removing local extrema from imprecise terrains ⋮ Quadratic kernelization for convex recoloring of trees ⋮ Convex recoloring of paths ⋮ Convex Recoloring of Paths

This page was built for publication: The Complexity of Minimum Convex Coloring