Total colorings of planar graphs with large maximum degree
From MaRDI portal
Publication:4355071
DOI<53::AID-JGT6>3.0.CO;2-G 10.1002/(SICI)1097-0118(199709)26:1<53::AID-JGT6>3.0.CO;2-GzbMath0883.05053OpenAlexW4251875867MaRDI QIDQ4355071
Alexandr V. Kostochka, Douglas R. Woodall, Oleg V. Borodin
Publication date: 17 September 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199709)26:1<53::aid-jgt6>3.0.co;2-g
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (51)
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 ⋮ \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree ⋮ Edge-face coloring of plane graphs with maximum degree nine ⋮ \(L(2, 1)\)-labelings of the edge-path-replacement of a graph ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ List edge and list total colourings of multigraphs ⋮ On total colorings of some special 1-planar graphs ⋮ \( L ( p , q )\)-labelings of subdivisions of graphs ⋮ Total coloring of planar graphs without adjacent chordal 6-cycles ⋮ \(L(d,1)\)-labelings of the edge-path-replacement of a graph ⋮ Total coloring of planar graphs without 6-cycles ⋮ Total choosability of planar graphs with maximum degree 4 ⋮ 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 ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Chromatic index, treewidth and maximum degree ⋮ \(L(2,1)\)-labelings of subdivisions of graphs ⋮ A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable ⋮ Total colorings of planar graphs without small cycles ⋮ Chromatic index, treewidth and maximum degree ⋮ 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 ⋮ List-edge and list-total colorings of graphs embedded on hyperbolic surfaces ⋮ Total colorings of planar graphs without adjacent triangles ⋮ Unnamed Item ⋮ On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles ⋮ 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 ⋮ The total chromatic number of some bipartite graphs
This page was built for publication: Total colorings of planar graphs with large maximum degree
