Pages that link to "Item:Q512886"
From MaRDI portal
The following pages link to Total coloring of planar graphs without adjacent short cycles (Q512886):
Displaying 5 items.
- Total coloring of planar graphs with 7-cycles containing at most two chords (Q391771) (← links)
- Total colorings of planar graphs without intersecting 5-cycles (Q444447) (← links)
- Total coloring of planar graphs without adjacent chordal 6-cycles (Q2410046) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)
- Minimum total coloring of planar graphs with maximum degree 8 (Q2698022) (← links)
