Distance Coloring

DOI10.1007/978-3-540-75520-3_46zbMath1151.05319OpenAlexW2911984978MaRDI QIDQ3527239

Alexa Sharp

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_46

zbMATH Keywords

graph coloringpower graphscomplexity threshold

Mathematics Subject Classification ID

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

Related Items (5)

Spectrum graph coloring and applications to Wi-Fi channel assignment ⋮ Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction ⋮ The \(k\)-distance chromatic number of trees and cycles ⋮ The distance coloring of graphs ⋮ On d-distance equitable chromatic number of some graphs

This page was built for publication: Distance Coloring