Pages that link to "Item:Q3495664"
From MaRDI portal
The following pages link to Improved edge-coloring algorithms for planar graphs (Q3495664):
Displaying 8 items.
- Improved bounds on linear coloring of plane graphs (Q625757) (← links)
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (Q845924) (← links)
- An efficient algorithm for edge coloring planar graphs with \(\Delta\) colors (Q914387) (← links)
- New linear-time algorithms for edge-coloring planar graphs (Q2479530) (← links)
- Improved square coloring of planar graphs (Q2685324) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- An NC Parallel Algorithm for Edge-Coloring Series–Parallel Multigraphs (Q4339008) (← links)
- A parallel algorithm for edge-coloring partial k-trees (Q5054775) (← links)