Every planar graph with Δ {\rm{\Delta }} ⩾ 8 is totally (Δ+2) ({\rm{\Delta }}+2)‐choosable
From MaRDI portal
Publication:6047966
Abstract: Total coloring is a variant of edge coloring where both vertices and edges are to be colored. A graph is totally -choosable if for any list assignment of colors to each vertex and each edge, we can extract a proper total coloring. In this setting, a graph of maximum degree needs at least colors. In the planar case, Borodin proved in 1989 that colors suffice when is at least 9. We show that this bound also holds when is .
Recommendations
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
- Total coloring of planar graphs with maximum degree 8
- Minimum total coloring of planar graphs with maximum degree 8
- Planar graphs with 8 are (+1)-edge-choosable
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
Cites work
- An introduction to the discharging method via graph coloring
- Colorings and orientations of graphs
- Colorings of plane graphs: a survey
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- scientific article; zbMATH DE number 4047751 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 3563170 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- List edge and list total colourings of multigraphs
- List Total Colourings of Graphs
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- Planar graphs with 8 are (+1)-edge-choosable
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total chromatic number of planar graphs with maximum degree ten
- Total-Coloring of Plane Graphs with Maximum Degree Nine
Cited in
(12)- Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable
- Total choosablility of planar graphs with maximum degree 5
- Planar graphs with 8 are (+1)-edge-choosable
- List total coloring of pseudo-outerplanar graphs
- On the total choosability of planar graphs and of sparse graphs
- A result on \(K\)-\((2,1)\)-total choosability of planar graphs
- Every graph is (2,3)-choosable
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable
- Square Coloring Planar Graphs with Automatic Discharging
- Total choosability of planar graphs with maximum degree 4
- A strengthening and an efficient implementation of Alon-Tarsi list coloring method
- Gain total graphs and their spectra via G-phases and group representations
This page was built for publication: Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047966)