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 14 items.
- Total coloring of planar graphs with 7-cycles containing at most two chords (Q391771) (← links)
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← links)
- A note on the total coloring of planar graphs without adjacent 4-cycles (Q427837) (← links)
- Total colorings of planar graphs without intersecting 5-cycles (Q444447) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- Total coloring of planar graphs without chordal short cycles (Q497376) (← links)
- Incidence coloring of planar graphs without adjacent small cycles (Q501990) (← links)
- Total colorings of planar graphs without adjacent triangles (Q998509) (← links)
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← links)
- Planar graphs without normally adjacent short cycles (Q2144582) (← 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)
- Planar graph colorings without short monochromatic cycles (Q4736767) (← links)
