Relaxation of Wegner's planar graph conjecture for maximum degree 4
From MaRDI portal
Publication:6611072
DOI10.1016/J.DAM.2024.07.011zbMATH Open1548.05118MaRDI QIDQ6611072
Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický
Publication date: 26 September 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Cites Work
- Title not available (Why is that?)
- An introduction to the discharging method via graph coloring
- Minimum 2-distance coloring of planar graphs and channel assignment
- The square of a planar cubic graph is 7-colorable
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
- Remarks on proper conflict-free colorings of graphs
- Wegner's conjecture on 2-distance coloring for planar graphs
- Linear colorings of subcubic graphs
- A bound on the chromatic number of the square of a planar graph
- Painting squares in \(\Delta^2-1\) shades
- Choosability of the square of a planar graph with maximum degree four
- List Colouring Squares of Planar Graphs
- On the structural result on normal plane maps
- Coloring Powers of Planar Graphs
- Coloring the square of a planar graph
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
- Square Coloring Planar Graphs with Automatic Discharging
This page was built for publication: Relaxation of Wegner's planar graph conjecture for maximum degree 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611072)
