Distance Coloring

DOI10.1007/978-3-540-75520-3_46zbMATH Open1151.05319OpenAlexW2911984978MaRDI QIDQ3527239FDOQ3527239

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

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

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)

Cited In (17)

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

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)