On total 9-coloring planar graphs of maximum degree seven
From MaRDI portal
Publication:4242734
DOI<67::AID-JGT6>3.0.CO;2-C 10.1002/(SICI)1097-0118(199905)31:1<67::AID-JGT6>3.0.CO;2-CzbMath0922.05025OpenAlexW4237246883MaRDI QIDQ4242734
Publication date: 17 October 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199905)31:1<67::aid-jgt6>3.0.co;2-c
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (69)
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles ⋮ 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 ⋮ On total chromatic number of planar graphs without 4-cycles ⋮ 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 ⋮ \([r,s,t\)-colorings of graphs] ⋮ \([r,s,t\)-chromatic numbers and hereditary properties of graphs] ⋮ On total colorings of some special 1-planar graphs ⋮ 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 ⋮ 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 ⋮ Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ 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 ⋮ On the total choosability of planar graphs and of sparse graphs ⋮ Total coloring of planar graphs without some adjacent cycles ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Facial entire colouring of plane graphs ⋮ Total coloring of embedded graphs of maximum degree at least ten ⋮ Total colorings-a survey ⋮ The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven ⋮ \((\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 ⋮ (\( \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 ⋮ The linear arboricity of planar graphs of maximum degree seven is four ⋮ 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 ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Entire colouring of plane graphs ⋮ On \((p,1)\)-total labelling of 1-planar graphs ⋮ Total colorings of planar graphs without chordal 6-cycles ⋮ Acyclic total colorings of planar graphs without \(l\) 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 ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Total colorings of planar graphs without small cycles ⋮ Total coloring of planar graphs without chordal short cycles ⋮ Total-coloring of sparse graphs with maximum degree 6 ⋮ Total coloring of planar graphs without adjacent short cycles ⋮ Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable ⋮ Total colorings of planar graphs without adjacent triangles ⋮ Total coloring of outer-1-planar graphs: the cold case ⋮ A larger family of planar graphs that satisfy the total coloring conjecture ⋮ Unnamed Item ⋮ 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 ⋮ 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 ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ The total chromatic number of regular graphs of even order and high degree ⋮ Planar graphs of maximum degree seven are Class I ⋮ Total coloring of planar graphs without some chordal 6-cycles ⋮ The total chromatic number of some bipartite graphs ⋮ On total colorings of 1-planar graphs
Cites Work
This page was built for publication: On total 9-coloring planar graphs of maximum degree seven
