Total coloring of recursive maximal planar graphs
From MaRDI portal
Publication:2078611
DOI10.1016/j.tcs.2022.01.024OpenAlexW4205222060MaRDI QIDQ2078611
Mingyuan Ma, Jin Xu, Yangyang Zhou, Dongyang Zhao
Publication date: 1 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.024
total chromatic numbertotal coloring\((2,2)\)-recursive maximal planar graphrecursive maximal planar graphtotal coloring algorithm
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Total colorings of planar graphs without adjacent triangles
- 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
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-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 Total Chromatic Number of a Graph
This page was built for publication: Total coloring of recursive maximal planar graphs