Pages that link to "Item:Q1057278"
From MaRDI portal
The following pages link to On linear-time algorithms for five-coloring planar graphs (Q1057278):
Displaying 7 items.
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763) (← links)
- Coloring certain proximity graphs (Q917569) (← links)
- Heuristic for rapidly four-coloring large planar graphs (Q1180542) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> (Q4844576) (← links)
- Contracting a Planar Graph Efficiently (Q5111739) (← links)
