Total colourings of planar graphs with large girth
From MaRDI portal
Publication:1378290
DOI10.1006/eujc.1997.0152zbMath0886.05065OpenAlexW1976755379MaRDI QIDQ1378290
Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
Publication date: 7 April 1998
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1997.0152
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Total coloring of planar graphs without chordal 7-cycles ⋮ \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree ⋮ \(L(2, 1)\)-labelings of the edge-path-replacement of a graph ⋮ List edge and list total colourings of multigraphs ⋮ \( L ( p , q )\)-labelings of subdivisions of graphs ⋮ \(L(d,1)\)-labelings of the edge-path-replacement of a graph ⋮ Total coloring of planar graphs without 6-cycles ⋮ On the double total dominator chromatic number of graphs ⋮ \((\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 embedded graphs of maximum degree at least ten ⋮ \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle ⋮ Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles ⋮ Total colorings of planar graphs without intersecting 5-cycles ⋮ On \((p,1)\)-total labelling of 1-planar graphs ⋮ \(L(2,1)\)-labelings of subdivisions of graphs ⋮ Total colorings of planar graphs without small cycles ⋮ 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 ⋮ A strict strong coloring of trees ⋮ Total and fractional total colourings of circulant graphs ⋮ Total colorings of planar graphs without adjacent triangles ⋮ Unnamed Item ⋮ 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 colourings of planar graphs with large girth
