On Distance Coloring

DOI10.1007/978-3-642-29485-3_18zbMath1354.68134OpenAlexW2162794051MaRDI QIDQ2897959

Alexa Sharp

Publication date: 16 July 2012

Published in: Logic and Program Semantics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29485-3_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Dichotomies properties on computational complexity of \(S\)-packing coloring problems

This page was built for publication: On Distance Coloring