Total chromatic number of planar graphs with maximum degree ten
From MaRDI portal
Publication:3422127
DOI10.1002/jgt.20195zbMath1110.05037OpenAlexW4253249961MaRDI QIDQ3422127
Publication date: 9 February 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20195
Related Items (45)
Total chromatic number of {square,unichord}-free graphs ⋮ The total coloring of \(K_5\)-minor-free graphs ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ Edge-face coloring of plane graphs with maximum degree nine ⋮ 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 ⋮ Edge-colouring and total-colouring chordless graphs ⋮ 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 without 6-cycles ⋮ Total choosability of planar graphs with maximum degree 4 ⋮ Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable ⋮ \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles ⋮ On the total choosability of planar graphs and of sparse graphs ⋮ Total coloring of planar graphs without some adjacent cycles ⋮ Total coloring of embedded graphs of maximum degree at least ten ⋮ List total colorings of planar graphs without triangles at small distance ⋮ \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle ⋮ A note on the total coloring of planar graphs without adjacent 4-cycles ⋮ (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles ⋮ Minimum total coloring of planar graphs with maximum degree 8 ⋮ Total chromatic number of unichord-free graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Entire colouring of plane graphs ⋮ Total colorings of planar graphs without chordal 6-cycles ⋮ 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 ⋮ \((2,1)\)-total labelling of outerplanar graphs ⋮ Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs ⋮ Total coloring of planar graphs without chordal short cycles ⋮ A decomposition for total-coloring partial-grids and list-total-coloring outerplanar 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 ⋮ Equitable total coloring of \(C_m\square C_n\) ⋮ On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles ⋮ Total coloring of recursive maximal planar graphs ⋮ The total chromatic number of regular graphs of high degree ⋮ 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 colorings and list total colorings of planar graphs without intersecting 4-cycles ⋮ Total coloring of planar graphs without some chordal 6-cycles
Cites Work
This page was built for publication: Total chromatic number of planar graphs with maximum degree ten
