Total colorings of planar graphs with small maximum degree
From MaRDI portal
(Redirected from Publication:360968)
Recommendations
Cited in
(15)- Total colorings-a survey
- The total coloring of planar graphs with a few \(3\)-faces incidents with vertex
- Total coloring of planar graphs with maximum degree \(7\)
- Total chromatic number of some families of graphs with maximum degree 3
- Total choosability of planar graphs with maximum degree 4
- Total chromatic number of planar graphs with few short cycles
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- Minimum total coloring of planar graphs with maximum degree 8
- Total coloring of planar graphs without some chordal 6-cycles
- On equitable colorings of sparse graphs
- The nil-graph of ideals of a commutative ring
- Acyclic total colorings of planar graphs.
- Total coloring of recursive maximal planar graphs
- A note on the minimum total coloring of planar graphs
- Color degree condition for long rainbow paths in edge-colored graphs
This page was built for publication: Total colorings of planar graphs with small maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360968)