Pages that link to "Item:Q393898"
From MaRDI portal
The following pages link to Total coloring of planar graphs with maximum degree 8 (Q393898):
Displaying 14 items.
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- Total coloring of planar graphs without short cycles (Q281812) (← links)
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← links)
- Total coloring of planar graphs without adjacent short cycles (Q512886) (← links)
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable (Q534337) (← links)
- Local condition for planar graphs of maximum degree 6 to be total 8-colorable (Q636063) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable (Q967320) (← links)
- Total coloring of planar graphs of maximum degree eight (Q991795) (← links)
- Total coloring of planar graphs with maximum degree \(7\) (Q1944191) (← links)
- Minimum total coloring of planar graphs with maximum degree 8 (Q2698022) (← links)
- Total coloring of planar graphs with maximum degree 8 and without specified subgraphs (Q2859863) (← links)
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable (Q6047966) (← links)
