Pages that link to "Item:Q3219789"
From MaRDI portal
The following pages link to A Linear Algorithm for Colouring Planar Graphs with Five Colours (Q3219789):
Displaying 5 items.
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Coloring certain proximity graphs (Q917569) (← links)
- On linear-time algorithms for five-coloring planar graphs (Q1057278) (← links)
- Distributed algorithms for maximum cliques (Q4338575) (← links)
- The complexity of growing a graph (Q6112002) (← links)