Minimum total coloring of planar graphs with maximum degree 8
From MaRDI portal
Publication:2698022
DOI10.1007/S10878-023-01011-YOpenAlexW4324345079MaRDI QIDQ2698022
Weili Wu, Liting Wang, Hui-Juan Wang
Publication date: 14 April 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-023-01011-y
Cites Work
- Total coloring of planar graphs with maximum degree 8
- Total coloring of planar graphs without adjacent short cycles
- Determining the total colouring number is NP-hard
- Total colorings of planar graphs without small cycles
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- Total colorings of planar graphs with maximum degree at least 8
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
- Total chromatic number of planar graphs with maximum degree ten
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- On total 9-coloring planar graphs of maximum degree seven
- Total colorings of planar graphs with large maximum degree
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
This page was built for publication: Minimum total coloring of planar graphs with maximum degree 8
