Pages that link to "Item:Q2453854"
From MaRDI portal
The following pages link to A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable (Q2453854):
Displaying 14 items.
- 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)
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable (Q534337) (← links)
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles (Q1033023) (← links)
- Planar graphs are \(9/2\)-colorable (Q1791701) (← links)
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable (Q1934390) (← links)
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable (Q2030446) (← links)
- Total colorings of planar graphs with sparse triangles (Q2437770) (← links)
- Plane graphs with maximum degree 9 are entirely 11-choosable (Q2629286) (← 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)
- (Q4980484) (← links)
- Extremal \(P_8\)-free/\(P_9\)-free planar graphs (Q6047577) (← links)
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable (Q6047966) (← links)
