Pages that link to "Item:Q1944191"
From MaRDI portal
The following pages link to Total coloring of planar graphs with maximum degree \(7\) (Q1944191):
Displaying 13 items.
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← 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)
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable (Q534337) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles (Q1043815) (← links)
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← links)
- A note on 1-planar graphs with minimum degree 7 (Q2217475) (← links)
- Total choosablility of planar graphs with maximum degree 5 (Q2858682) (← links)
- The linear arboricity of planar graphs of maximum degree seven is four (Q3522847) (← links)
- On total 9-coloring planar graphs of maximum degree seven (Q4242734) (← links)
- Total colorings of planar graphs with large maximum degree (Q4355071) (← links)
- (Q5368223) (← links)