A note on 3-distance coloring of planar graphs
From MaRDI portal
Publication:6563283
DOI10.1007/S41980-023-00848-7zbMATH Open1541.05036MaRDI QIDQ6563283
Kenta Ozeki, Morteza Hasanvand
Publication date: 27 June 2024
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Map-colour theorem.
- The square of a planar cubic graph is 7-colorable
- A unified approach to distance-two colouring of graphs on surfaces
- Brooks' theorem on powers of graphs
- A bound on the chromatic number of the square of a planar graph
- List Colouring Squares of Planar Graphs
- List-coloring the square of a subcubic graph
- Every planar map is four colorable
- Coloring Powers of Planar Graphs
- On Representatives of Subsets
This page was built for publication: A note on 3-distance coloring of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563283)
