Total coloring of embedded graphs of maximum degree at least ten
From MaRDI portal
Publication:625795
DOI10.1007/S11425-010-3089-5zbMATH Open1210.05040OpenAlexW2170724959MaRDI QIDQ625795FDOQ625795
Authors: Bin Liu, Jianfeng Hou, Jian-Liang Wu, Guizhen Liu 
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
Recommendations
- Total coloring of embedded graphs with maximum degree at least seven
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- On the Total Coloring of Graphs Embeddable in Surfaces
- Total colorings of embedded graphs with maximum degree seven and without \(3\)-cycles adjacent to \(5\)-cycles.
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
Cites Work
- List edge and list total colorings of planar graphs without 4-cycles
- 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
- Total colorings of planar graphs with large maximum degree
- A note on total colorings of planar graphs without 4-cycles
- Title not available (Why is that?)
- On Total Chromatic Number of a Graph
- Determining the total colouring number is NP-hard
- On the Total Coloring of Graphs Embeddable in Surfaces
- The total coloring of a multigraph with maximal degree 4
- Total colorings of planar graphs without small cycles
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
Cited In (10)
- Total coloring of embedded graphs with maximum degree at least seven
- Total colorings-a survey
- The total coloring of \(K_5\)-minor-free graphs
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
- The entire chromatic number of graphs embedded on the torus with large maximum degree
- Total colorings of embedded graphs with maximum degree seven and without \(3\)-cycles adjacent to \(5\)-cycles.
- Reconfiguring 10-colourings of planar graphs
- On graph proper total colorings with labelling-type restrictions
This page was built for publication: Total coloring of embedded graphs of maximum degree at least ten
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625795)
