The following pages link to A five-color theorem (Q1567630):
Displaying 10 items.
- Plane graphs with maximum degree 6 are edge-face 8-colorable (Q742598) (← links)
- A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs (Q1613521) (← links)
- A six-color theorem for the edge-face coloring of plane graphs (Q1894780) (← links)
- Edge-face list coloring of Halin graphs (Q2039700) (← links)
- Facial edge-face coloring of \(K_4\)-minor-free graphs (Q2174603) (← links)
- The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
- The edge-face choosability of plane graphs with maximum degree at least 9 (Q2449158) (← links)
- An addition theorem for the color number (Q2716127) (← links)
- (Q5502080) (← links)
- (Q5869435) (← links)