Pages that link to "Item:Q5943052"
From MaRDI portal
The following pages link to On improving the edge-face coloring theorem (Q5943052):
Displayed 10 items.
- Entire colouring of plane graphs (Q651038) (← links)
- Plane graphs with maximum degree 6 are edge-face 8-colorable (Q742598) (← links)
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- The edge-face coloring of graphs embedded in a surface of characteristic zero (Q1025544) (← links)
- Planar graphs of maximum degree seven are Class I (Q1850561) (← links)
- The edge-face choosability of plane graphs (Q1883606) (← links)
- Edge-face list coloring of Halin graphs (Q2039700) (← links)
- Facial edge-face coloring of \(K_4\)-minor-free graphs (Q2174603) (← links)
- The edge-face choosability of plane graphs with maximum degree at least 9 (Q2449158) (← links)
- Edge-face coloring of plane graphs with maximum degree nine (Q3168662) (← links)