Distance Coloring
From MaRDI portal
Publication:3527239
Recommendations
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)