Degeneracy and colorings of squares of planar graphs without 4-cycles
From MaRDI portal
Publication:2658379
DOI10.1007/s00493-019-4014-3zbMath1488.05178arXiv1806.07204OpenAlexW3039291421MaRDI QIDQ2658379
Daniel W. Cranston, Théo Pierron, Ilkyoo Choi
Publication date: 20 March 2021
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.07204
Cites Work
- An introduction to the discharging method via graph coloring
- Colorings and orientations of graphs
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
- Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
- Coloring squares of planar graphs with girth six
- A unified approach to distance-two colouring of graphs on surfaces
- A bound on the chromatic number of the square of a planar graph
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- List Colouring Squares of Planar Graphs
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles
- 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles
This page was built for publication: Degeneracy and colorings of squares of planar graphs without 4-cycles
