Pages that link to "Item:Q967320"
From MaRDI portal
The following pages link to Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable (Q967320):
Displaying 17 items.
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- Total coloring of planar graphs without short cycles (Q281812) (← links)
- A note on the minimum total coloring of planar graphs (Q326982) (← links)
- Total coloring of planar graphs with maximum degree 8 (Q393898) (← links)
- Total colorings of \(F_5\)-free planar graphs with maximum degree 8 (Q405156) (← links)
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- Total coloring of planar graphs without chordal short cycles (Q497376) (← links)
- Total coloring of planar graphs without adjacent short cycles (Q512886) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← links)
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable (Q1934390) (← links)
- \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle (Q1944131) (← links)
- Total coloring of planar graphs without adjacent chordal 6-cycles (Q2410046) (← links)
- Total colorings of planar graphs with sparse triangles (Q2437770) (← links)
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable (Q2453854) (← links)
- Minimum total coloring of planar graphs with maximum degree 8 (Q2698022) (← links)
