Vertex cover in graphs with locally few colors

DOI10.1016/J.IC.2011.12.008zbMath1266.05036OpenAlexW1969443695MaRDI QIDQ1951586

Fabian Kuhn, Monaldo Mastrolilli

Publication date: 6 June 2013

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

Full work available at URL: https://doi.org/10.1016/j.ic.2011.12.008

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The feedback arc set problem with triangle inequality is a vertex cover problem

This page was built for publication: Vertex cover in graphs with locally few colors