Minimum 2-distance coloring of planar graphs and channel assignment

DOI10.1007/s10878-018-0285-7zbMath1400.05092OpenAlexW2795359627MaRDI QIDQ724734

Yuehua Bu, Junlei Zhu

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

planar graphsmaximum degree2-distance coloring

Mathematics Subject Classification ID

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

Related Items (11)

Wegner's conjecture on 2-distance coloring ⋮ Wegner's conjecture on 2-distance coloring for planar graphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Optimal \(r\)-dynamic coloring of sparse graphs ⋮ Improved square coloring of planar graphs ⋮ The \(r\)-dynamic chromatic number of planar graphs without special short cycles ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ 2-distance choosability of planar graphs with a restriction for maximum degree ⋮ \(2\)-distance coloring of planar graphs with maximum degree \(5\) ⋮ The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles ⋮ 2-distance choice number of planar graphs with maximal degree no more than 4

Cites Work

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

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