Pages that link to "Item:Q1894780"
From MaRDI portal
The following pages link to A six-color theorem for the edge-face coloring of plane graphs (Q1894780):
Displaying 7 items.
- Plane graphs with maximum degree 6 are edge-face 8-colorable (Q742598) (← links)
- Simultaneously colouring the edges and faces of plane graphs (Q1354728) (← links)
- A five-color theorem (Q1567630) (← links)
- The edge-face choosability of plane graphs with maximum degree at least 9 (Q2449158) (← links)
- A 6-chromatic odd-distance graph in the plane (Q5104358) (← links)
- Edge-face total chromatic number of outerplanar graphs with Δ (G)=6 (Q6085733) (← links)
- An improved upper bound on the edge-face coloring of 2-connected plane graphs (Q6611726) (← links)