Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
From MaRDI portal
Publication:476647
DOI10.1007/s11425-013-4576-2zbMath1299.05135OpenAlexW2037092384MaRDI QIDQ476647
Bing Wang, Hui-Juan Wang, Bin Liu, Jian Liang Wu
Publication date: 2 December 2014
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-013-4576-2
Related Items (4)
The total coloring of \(K_5\)-minor-free graphs ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ Total colorings-a survey ⋮ Total coloring of planar graphs without chordal short cycles
Cites Work
- Unnamed Item
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Total coloring of planar graphs without 6-cycles
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- On maximal injective subalgebras in a \(w\Gamma\) factor
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- 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
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
- On the total coloring of certain graphs
- Total chromatic number of planar graphs with maximum degree ten
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- 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
- On Total Chromatic Number of a Graph
This page was built for publication: Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
