Pages that link to "Item:Q914387"
From MaRDI portal
The following pages link to An efficient algorithm for edge coloring planar graphs with \(\Delta\) colors (Q914387):
Displaying 5 items.
- A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring (Q1095923) (← links)
- Parallel algorithms for the edge-coloring and edge-coloring update problems (Q1911806) (← links)
- New linear-time algorithms for edge-coloring planar graphs (Q2479530) (← links)
- Improved edge-coloring algorithms for planar graphs (Q3495664) (← links)
- Efficient parallel algorithms for edge coloring problems (Q3783599) (← links)