Total colorings of planar graphs with large maximum degree
From MaRDI portal
Publication:4355071
DOI10.1002/(SICI)1097-0118(199709)26:1%3C53::AID-JGT6%3E3.0.CO;2-GzbMATH Open0883.05053OpenAlexW4251875867MaRDI QIDQ4355071FDOQ4355071
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
Recommendations
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (60)
- Chromatic index, treewidth and maximum degree
- Title not available (Why is that?)
- \( L ( p , q )\)-labelings of subdivisions of graphs
- Randomly coloring planar graphs with fewer colors than the maximum degree
- On the total choosability of planar graphs and of sparse graphs
- Total colorings of planar graphs without small cycles
- Total colorings of planar graphs with sparse triangles
- Total coloring of planar graphs without chordal 7-cycles
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- 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
- Entire colouring of plane graphs
- Total coloring of 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
- Total colorings of \(F_5\)-free planar graphs with maximum degree 8
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Total colorings of planar graphs without intersecting 5-cycles
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- Total coloring of planar graphs without short cycles
- Total coloring of planar graphs without 6-cycles
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- The total coloring of \(K_5\)-minor-free graphs
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles
- List edge and list total colourings of multigraphs
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- Total choosability of planar graphs with maximum degree 4
- List total colorings of planar graphs without triangles at small distance
- Edge-face coloring of plane graphs with maximum degree nine
- Randomly colouring graphs (a combinatorial view)
- Total coloring of planar graphs of maximum degree eight
- \(L(2, 1)\)-labelings of the edge-path-replacement of a graph
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
- Total coloring of planar graphs with maximum degree \(7\)
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- Minimum total coloring of planar graphs with maximum degree 8
- Total colorings of planar graphs without adjacent triangles
- A note on maximum differential coloring of planar graphs
- \(L(2,1)\)-labelings of subdivisions of graphs
- Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
- Total coloring of embedded graphs of maximum degree at least ten
- Total colorings of planar graphs without chordal 6-cycles
- \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
- The total chromatic number of some bipartite graphs
- On total colorings of some special 1-planar graphs
- On \((p,1)\)-total labelling of 1-planar graphs
- Total coloring of planar graphs without adjacent chordal 6-cycles
- Thoroughly dispersed colorings
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- On the total coloring of planar graphs.
- Chromatic index, treewidth and maximum degree
- Total coloring of planar graphs without some adjacent cycles
- A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
- \(L(d,1)\)-labelings of the edge-path-replacement of a graph
- Total coloring of recursive maximal planar graphs
- \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
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)
