Pages that link to "Item:Q2479530"
From MaRDI portal
The following pages link to New linear-time algorithms for edge-coloring planar graphs (Q2479530):
Displayed 4 items.
- Complexity and algorithms for injective edge-coloring in graphs (Q2032162) (← links)
- Total tessellation cover: bounds, hardness, and applications (Q2091795) (← links)
- A Planar linear arboricity conjecture (Q2891050) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)