Total-Coloring of Plane Graphs with Maximum Degree Nine
From MaRDI portal
Publication:3648509
DOI10.1137/070688389zbMath1184.05046OpenAlexW2060518991MaRDI QIDQ3648509
Riste Škrekovski, Jean-Sébastien Sereni, Łukasz Kowalik
Publication date: 27 November 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070688389
Related Items
The total coloring of \(K_5\)-minor-free graphs ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ Edge-face coloring of plane graphs with maximum degree nine ⋮ A note on the minimum total coloring of planar graphs ⋮ Total coloring of claw-free planar graphs ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ Total coloring of planar graphs without adjacent chordal 6-cycles ⋮ A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable ⋮ Total coloring of planar graphs with 7-cycles containing at most two chords ⋮ Total coloring of embedded graphs with maximum degree at least seven ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable ⋮ Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable ⋮ Total colorings of \(F_5\)-free planar graphs with maximum degree 8 ⋮ \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles ⋮ Total coloring of planar graphs without some adjacent cycles ⋮ Total colorings-a survey ⋮ \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle ⋮ Total coloring of planar graphs with maximum degree \(7\) ⋮ A note on the total coloring of planar graphs without adjacent 4-cycles ⋮ Minimum total coloring of planar graphs with maximum degree 8 ⋮ Total colorings of planar graphs with sparse triangles ⋮ Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles ⋮ Total colorings of planar graphs without intersecting 5-cycles ⋮ Entire colouring of plane graphs ⋮ On \((p,1)\)-total labelling of 1-planar graphs ⋮ Total colorings of planar graphs without chordal 6-cycles ⋮ Minimum total coloring of planar graph ⋮ Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable ⋮ On \((p, 1)\)-total labelling of some 1-planar graphs ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Total coloring of planar graphs without chordal short cycles ⋮ Total coloring of planar graphs without adjacent short cycles ⋮ On \((p,1)\)-total labelling of planar graphs ⋮ A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five ⋮ Local condition for planar graphs of maximum degree 7 to be 8-totally colorable ⋮ Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable ⋮ Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable ⋮ Total coloring of planar graphs of maximum degree eight ⋮ On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles ⋮ Total coloring of recursive maximal planar graphs ⋮ Total colorings of planar graphs with maximum degree at least 8 ⋮ On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles ⋮ Total coloring of planar graphs without some chordal 6-cycles
