Pages that link to "Item:Q911763"
From MaRDI portal
The following pages link to Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763):
Displaying 6 items.
- Coloring algorithms for \(K_ 5\)-minor free graphs (Q910220) (← links)
- Heuristic for rapidly four-coloring large planar graphs (Q1180542) (← links)
- A self-stabilizing algorithm for coloring planar graphs (Q1310570) (← links)
- An algorithm for coloring some perfect graphs (Q1382811) (← links)
- An algorithm for colouring perfect planar graphs (Q1825203) (← links)
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581) (← links)