Minimum 2-distance coloring of planar graphs and channel assignment

DOI10.1007/S10878-018-0285-7zbMATH Open1400.05092OpenAlexW2795359627MaRDI QIDQ724734FDOQ724734

Authors Junlei Zhu, Yuehua Bu

Publication date 26 July 2018

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-018-0285-7

zbMATH Keywords

maximum degreeplanar graphs2-distance coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Wegner's conjecture on 2-distance coloring
• \(2\)-distance coloring of planar graphs with maximum degree \(5\)
• Wegner's conjecture on 2-distance coloring for planar graphs
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
• 2-Distance coloring of planar graphs without short cycles

Cites work

• A bound on the chromatic number of the square of a planar graph
• A note on 2-facial coloring of plane graphs
• A note on 3-choosability of plane graphs under distance restrictions
• Bounds for the dichromatic number of a generalized lexicographic product of digraphs
• Coloring Powers of Planar Graphs
• Coloring the square of a planar graph
• Graph theory
• Labelling Graphs with a Condition at Distance 2
• Radio \(k\)-chromatic number of cycles for large \(k\)
• Strong edge-coloring of subcubic planar graphs
• \(b\)-chromatic sum of a graph

Cited in

(15)

• Relaxation of Wegner's planar graph conjecture for maximum degree 4
• Coloring squares of planar graphs with maximum degree at most five
• Channel assignment problem and relaxed 2-distant coloring of graphs
• Wegner's conjecture on 2-distance coloring
• The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles
• scientific article; zbMATH DE number 844150 (Why is no real title available?)
• \(2\)-distance coloring of planar graphs with maximum degree \(5\)
• \(2\)-distance choice number of planar graphs with maximal degree no more than 4
• 2-distance choosability of planar graphs with a restriction for maximum degree
• Graph \(r\)-hued colorings -- a survey
• Improved square coloring of planar graphs
• Wegner's conjecture on 2-distance coloring for planar graphs
• Improved 2-distance coloring of planar graphs with maximum degree 5
• Optimal \(r\)-dynamic coloring of sparse graphs
• The \(r\)-dynamic chromatic number of planar graphs without special short cycles

This page was built for publication: Minimum 2-distance coloring of planar graphs and channel assignment

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