Total colorings of planar graphs without adjacent 5-cycles.
From MaRDI portal
Publication:5206440
Recommendations
- Total colorings of planar graphs with maximum degree at least 7 and without adjacent 5-cycles
- Total colorings of planar graphs without 5-cycles and adjacent 6-cycles
- Total colorings of planar graphs without 6-cycles and adjacent 5-cycles
- Total coloring of planar graphs without short cycles
- Total coloring of planar graphs without adjacent short cycles
Cited in
(12)- Total coloring of planar graphs without adjacent short cycles
- Total colorings of planar graphs with sparse triangles
- Total colorings of F₅-free planar graphs with maximum degree 8
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Total colorings of planar graphs without intersecting 5-cycles
- Total coloring of planar graphs without short cycles
- Total colorings of planar graphs without 5-cycles and adjacent 6-cycles
- Total colorings of embedded graphs with maximum degree seven and without \(3\)-cycles adjacent to \(5\)-cycles.
- Total colorings of planar graphs with maximum degree at least 7 and without adjacent 5-cycles
- Total coloring of outer-1-planar graphs with near-independent crossings
- Total colorings of planar graphs without 6-cycles and adjacent 5-cycles
- Total coloring of planar graphs without some adjacent cycles
This page was built for publication: Total colorings of planar graphs without adjacent 5-cycles.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206440)
