Total coloring of embedded graphs of maximum degree at least ten
From MaRDI portal
Publication:625795
DOI10.1007/s11425-010-3089-5zbMath1210.05040OpenAlexW2170724959MaRDI QIDQ625795
Bin Liu, Jian-Feng Hou, Gui Zhen Liu, Jian Liang Wu
Publication date: 25 February 2011
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-010-3089-5
Related Items
The total coloring of \(K_5\)-minor-free graphs ⋮ Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable ⋮ Total colorings-a survey ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- List edge and list total colorings of planar graphs without 4-cycles
- Determining the total colouring number is NP-hard
- Total colorings of planar graphs without small cycles
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- The total coloring of a multigraph with maximal degree 4
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colourings of planar graphs with large girth
- Total colourings of graphs
- On the total coloring of certain graphs
- Total chromatic number of planar graphs with maximum degree ten
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- On the Total Coloring of Graphs Embeddable in Surfaces
- A note on total colorings of planar graphs without 4-cycles
- On Total Chromatic Number of a Graph
