Pages that link to "Item:Q3934416"
From MaRDI portal
The following pages link to A linear 5-coloring algorithm of planar graphs (Q3934416):
Displayed 12 items.
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763) (← links)
- Coloring certain proximity graphs (Q917569) (← links)
- On linear-time algorithms for five-coloring planar graphs (Q1057278) (← links)
- Heuristic for rapidly four-coloring large planar graphs (Q1180542) (← links)
- Storing the subdivision of a polyhedral surface (Q1820438) (← links)
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs (Q1892581) (← links)
- Fast 3-coloring triangle-free planar graphs (Q1957652) (← links)
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces (Q2309464) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)