Distance Coloring

DOI10.1007/978-3-540-75520-3_46MaRDI QIDQ3527239zbMATHOpenAlexFDO

Authors 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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On Distance Coloring
• Vertex colorings with a distance restriction
• Algorithms for finding distance-edge-colorings of graphs
• Computing and Combinatorics
• Distance graphs and the \(T\)-coloring problem

Cited in

(19)

• Construction of sparse graphs with prescribed circular colorings
• Spectrum graph coloring and applications to Wi-Fi channel assignment
• On \(t\)-relaxed 2-distant circular coloring of graphs
• The distance polytope for the vertex coloring problem
• The maximum k-differential coloring problem
• Notes on models for distance coloring problems
• A survey on the distance-colouring of graphs
• On d-distance equitable chromatic number of some graphs
• Connectedness of finite distance graphs
• Vertex colorings with a distance restriction
• The maximum \(k\)-differential coloring problem
• Systems of pairs of \(q\)-distant representatives, and graph colorings
• Dichotomy for coloring of dart graphs
• Algorithms for finding distance-edge-colorings of graphs
• Computing and Combinatorics
• The \(k\)-distance chromatic number of trees and cycles
• The distance coloring of graphs
• Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
• Average distance in colored graphs

This page was built for publication: Distance Coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527239)