Total coloring of recursive maximal planar graphs
From MaRDI portal
Publication:2078611
Recommendations
- On the coloring of maximal planar graphs
- Total colorings of planar graphs with large maximum degree
- On the total coloring of planar graphs.
- Total colorings of planar graphs with small maximum degree
- Complete colorings of planar graphs
- Total colourings of planar graphs with large girth
- scientific article; zbMATH DE number 5525887
- scientific article; zbMATH DE number 613296
- TOTAL COLORING OF CERTAIN GRAPHS
- Acyclic total colorings of planar graphs.
Cites work
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
- Graph theory with applications
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- On Total Chromatic Number of a Graph
- The total chromatic number of any multigraph with maximum degree five is at most seven
- The total coloring of a multigraph with maximal degree 4
- Total chromatic number of planar graphs with maximum degree ten
- Total colorings of planar graphs without adjacent triangles
- Total-Coloring of Plane Graphs with Maximum Degree Nine
Cited in
(4)
This page was built for publication: Total coloring of recursive maximal planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2078611)