Coloring the square of maximal Planar graphs with diameter two

DOI10.1016/j.amc.2023.128263OpenAlexW4385522698MaRDI QIDQ6048644

Qiuyue Tan, Yi Qiao Wang, Jingjing Huo, Jiangxu Kong

Publication date: 11 October 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2023.128263

zbMATH Keywords

diameterchromatic numberWegner's conjecturemaximal Planar graph

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites Work

• Largest planar graphs of diameter two and fixed maximum degree
• Labelling planar graphs without 4-cycles with a condition on distance two
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
• The square of a planar cubic graph is 7-colorable
• The sizes of maximal planar, outerplanar, and bipartite planar subgraphs
• A unified approach to distance-two colouring of graphs on surfaces
• A bound on the chromatic number of the square of a planar graph
• Maximal planar graphs of diameter two
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles

This page was built for publication: Coloring the square of maximal Planar graphs with diameter two