Pages that link to "Item:Q3168662"
From MaRDI portal
The following pages link to Edge-face coloring of plane graphs with maximum degree nine (Q3168662):
Displaying 10 items.
- Entire colouring of plane graphs (Q651038) (← links)
- Plane graphs with maximum degree 6 are edge-face 8-colorable (Q742598) (← links)
- Facial entire colouring of plane graphs (Q898120) (← links)
- Simultaneous coloring of edges and faces of plane graphs (Q1322167) (← links)
- A five-color theorem (Q1567630) (← links)
- A six-color theorem for the edge-face coloring of plane graphs (Q1894780) (← links)
- The edge-face choosability of plane graphs with maximum degree at least 9 (Q2449158) (← links)
- (Q4980484) (← links)
- Plane graphs of maximum degree Δ ≥ 7 are edge‐face (Δ + 1)‐colorable (Q5066912) (← links)
- An improved upper bound on the edge-face coloring of 2-connected plane graphs (Q6611726) (← links)