Coloring squares of planar graphs with maximum degree at most five

DOI10.1007/S00373-023-02615-1OpenAlexW4320039150MaRDI QIDQ2689129FDOQ2689129

Authors: Yin-dong Jin, Qian Zhao, Jianfeng Hou, Lianying Miao 

Publication date: 9 March 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-023-02615-1

Recommendations

• Coloring the square of a planar graph
• New upper bound on the chromatic number of the square of a planar graph
• Chromatic number of square of maximal outerplanar graphs
• A bound on the chromatic number of the square of a planar graph
• Coloring the square of an outerplanar graph

zbMATH Keywords

chromatic numberplanar graphsquare coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Labelling Graphs with a Condition at Distance 2
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• An optimal square coloring of planar graphs
• \(2\)-distance coloring of planar graphs with maximum degree \(5\)
• A bound on the chromatic number of the square of a planar graph
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
• Coloring the square of a \(K_{4}\)-minor free graph
• Coloring Powers of Planar Graphs
• Choosability of the square of a planar graph with maximum degree four
• List 2-facial 5-colorability of plane graphs with girth at least 12
• Title not available (Why is that?)
• Minimum 2-distance coloring of planar graphs and channel assignment
• On \(L (p, q)\)-labelling of planar graphs without cycles of length four
• \(L(p, q)\)-labeling of planar graphs with small girth
• The List \(L(2, 1)\)-labeling of planar graphs
• Coloring graphs without bichromatic cycles or paths
• List 2-distance coloring of planar graphs without short cycles
• The square of a planar cubic graph is 7-colorable
• Choosability with union separation of triangle-free planar graphs
• Acyclic coloring of graphs with maximum degree 7
• 2-distance coloring of planar graphs without 4-cycles and 5-cycles

Cited In (12)

• Degeneracy and colorings of squares of planar graphs without 4-cycles
• Coloring squares of graphs with mad constraints
• Coloring the square of a planar graph
• The Chromatic Number of Graph Powers
• Title not available (Why is that?)
• Edge colorings of planar graphs with maximum degree five.
• A general approach to distance-two colouring of graphs on surfaces
• Square Coloring of Planar Graphs with Maximum Degree at Most Five
• Improved 2-distance coloring of planar graphs with maximum degree 5
• Chromatic number of square of maximal outerplanar graphs
• Title not available (Why is that?)
• On \(L (p, q)\)-labelling of planar graphs without cycles of length four

This page was built for publication: Coloring squares of planar graphs with maximum degree at most five

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