Total-coloring of sparse graphs with maximum degree 6
From MaRDI portal
Publication:2240657
Recommendations
- Acyclic coloring of graphs with maximum degree at most six
- Acyclic vertex coloring of graphs of maximum degree six
- Total colorings of planar graphs with maximum degree 6 and without adjacent chordal 6-cycles
- 19-linear-colorable graphs with maximum degree 6
- Sparse \(H\)-colourable graphs of bounded maximum degree
- Acyclic 6-colouring of graphs with maximum degree 5 and small maximum average degree
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
- A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
- Total coloring of plane graphs with maximum degree six and without intersecting triangles and 4-cycles
- Strong edge-colorings of sparse graphs with large maximum degree
Cites work
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- A bound on the total chromatic number
- An Improvement of Hind's Upper Bound on the Total Chromatic Number
- An upper bound for the total chromatic number
- Graph theory with applications
- Local condition for planar graphs of maximum degree 6 to be total 8-colorable
- On Total Chromatic Number of a Graph
- 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 colourings of graphs
- Planar graphs of maximum degree seven are Class I
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- 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
Cited in
(3)
This page was built for publication: Total-coloring of sparse graphs with maximum degree 6
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2240657)
