Wegner's conjecture on 2-distance coloring

DOI10.1007/978-3-030-93176-6_34zbMath1504.05104OpenAlexW4206310118MaRDI QIDQ2151384

Junlei Zhu, Yuehua Bu, Hongguo Zhu

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_34

zbMATH Keywords

girthplanar graphmaximum degree2-distance coloringWegner's conjecture

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (2)

Wegner's conjecture on 2-distance coloring for planar graphs ⋮ Square Coloring Planar Graphs with Automatic Discharging

Cites Work

• Minimum 2-distance coloring of planar graphs and channel assignment
• A note on 2-facial coloring of plane graphs
• \(T\)-colorings of graphs: recent results and open problems
• Upper bounds of \(r\)-hued colorings of planar graphs
• A bound on the chromatic number of the square of a planar graph
• Labelling Graphs with a Condition at Distance 2
• Coloring Powers of Planar Graphs
• Coloring the square of a planar graph

This page was built for publication: Wegner's conjecture on 2-distance coloring