On the radiocoloring problem
From MaRDI portal
Recommendations
Cited in
(12)- Modeling the packing coloring problem of graphs
- Radiocoloring in planar graphs: Complexity and approximations
- Radio antipodal colorings of cycles
- scientific article; zbMATH DE number 2068175 (Why is no real title available?)
- NP-completeness results and efficient approximations for radiocoloring in planar graphs
- Hole: An Emerging Character in the Story of Radio k-Coloring Problem
- scientific article; zbMATH DE number 2170479 (Why is no real title available?)
- Graph radio coloring concepts
- Optimal radiocoloring of trees
- Combinatorial Geometry and Graph Theory
- Generating and radiocoloring families of perfect graphs
- Labeling trees with a condition at distance two
This page was built for publication: On the radiocoloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414573)