Improved square coloring of planar graphs
From MaRDI portal
Publication:2685324
DOI10.1016/j.disc.2022.113288OpenAlexW4311254117MaRDI QIDQ2685324
Quentin Deschamps, Nicolas Bousquet, Lucas de Meyer, Théo Pierron
Publication date: 21 February 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.12512
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 ⋮ Square Coloring Planar Graphs with Automatic Discharging
Cites Work
- Unnamed Item
- Minimum 2-distance coloring of planar graphs and channel assignment
- A unified approach to distance-two colouring of graphs on surfaces
- A bound on the chromatic number of the square of a planar graph
- List Colouring Squares of Planar Graphs
- Every planar map is four colorable
- On the structural result on normal plane maps
- Coloring Powers of Planar Graphs
- Coloring the square of a planar graph
This page was built for publication: Improved square coloring of planar graphs
