Total colorings of planar graphs with large maximum degree

DOI10.1002/(SICI)1097-0118(199709)26:1%3C53::AID-JGT6%3E3.0.CO;2-GMaRDI QIDQ4355071zbMATH OpenOpenAlexFDO

Authors Oleg V. Borodin, Alexandr Kostochka, Douglas R. Woodall

Publication date 17 September 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199709)26:1%3C53::aid-jgt6%3E3.0.co;2-g

maximum degree planar graph total chromatic number

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

Total colorings of planar graphs with small maximum degree
Total coloring of planar graphs with maximum degree seven
Total coloring of planar graphs with maximum degree \(7\)
Total colorings of planar graphs without small cycles
On the total coloring of planar graphs.

Cited in

(59)

Chromatic index, treewidth and maximum degree
scientific article; zbMATH DE number 2230302 (Why is no real title available?)
Total coloring of planar graphs with maximum degree 8
Total colorings of planar graphs with sparse triangles
The total coloring of \(K_5\)-minor-free graphs
\(L(2,1)\)-labelings of subdivisions of graphs
Total coloring of embedded graphs of maximum degree at least ten
Total coloring of planar graphs without chordal 7-cycles
Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
Edge-face coloring of plane graphs with maximum degree nine
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
\((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles
Randomly colouring graphs (a combinatorial view)
Total colorings of \(F_5\)-free planar graphs with maximum degree 8
The total chromatic number of some bipartite graphs
(\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
Thoroughly dispersed colorings
Total coloring of planar graphs with maximum degree \(7\)
Total colorings and list total colorings of planar graphs without intersecting 4-cycles
\((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
Total coloring of planar graphs without short cycles
A note on the total coloring of planar graphs without adjacent 4-cycles
On total colorings of some special 1-planar graphs
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
List edge and list total colourings of multigraphs
On the total coloring of planar graphs.
On the total choosability of planar graphs and of sparse graphs
On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
Total coloring of planar graphs of maximum degree eight
Total colorings of planar graphs without intersecting 5-cycles
Total choosability of planar graphs with maximum degree 4
List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
List total colorings of planar graphs without triangles at small distance
\( L ( p , q )\)-labelings of subdivisions of graphs
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
Minimum total coloring of planar graphs with maximum degree 8
Total-Coloring of Plane Graphs with Maximum Degree Nine
Total colorings of planar graphs without chordal 6-cycles
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
\(L(d,1)\)-labelings of the edge-path-replacement of a graph
Total coloring of planar graphs without 6-cycles
Total colorings of planar graphs with maximum degree at least 8
On \((p,1)\)-total labelling of 1-planar graphs
Total colorings of planar graphs without adjacent triangles
The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
Chromatic index, treewidth and maximum degree
\((\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 without adjacent chordal 6-cycles
Entire colouring of plane graphs
A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
Total coloring of recursive maximal planar graphs
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
\(L(2, 1)\)-labelings of the edge-path-replacement of a graph
Total coloring of planar graphs without some adjacent cycles
A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
A note on maximum differential coloring of planar graphs
Total colorings of planar graphs without small cycles

This page was built for publication: Total colorings of planar graphs with large maximum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355071)