Tree-like distance colouring for planar graphs of sufficient girth

zbMath1409.05087arXiv1805.02156MaRDI QIDQ668079

Ross J. Kang, Willem van Loon

Publication date: 5 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.02156

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)

Related Items (1)

Strong chromatic index and Hadwiger number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong chromatic index of planar graphs with large girth
• Strong chromatic index of subcubic planar multigraphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• A bound on the strong chromatic index of a graph
• Colouring squares of claw-free graphs
• Planar graphs of maximum degree seven are Class I
• Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
• List Colouring Squares of Planar Graphs
• Coloring Powers of Planar Graphs
• Constructions of large planar networks with given degree and diameter
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems
• Precise upper bound for the strong edge chromatic number of sparse planar graphs
• A Theorem on Coloring the Lines of a Network
• Local structures in plane maps and distance colourings

This page was built for publication: Tree-like distance colouring for planar graphs of sufficient girth