Pages that link to "Item:Q625795"
From MaRDI portal
The following pages link to Total coloring of embedded graphs of maximum degree at least ten (Q625795):
Displaying 7 items.
- Total coloring of embedded graphs with maximum degree at least seven (Q391777) (← links)
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q476647) (← links)
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable (Q1934390) (← links)
- The total coloring of \(K_5\)-minor-free graphs (Q2122692) (← links)
- Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles (Q2359808) (← links)
- The entire chromatic number of graphs embedded on the torus with large maximum degree (Q2402264) (← links)
- Reconfiguring 10-colourings of planar graphs (Q2657051) (← links)