Pages that link to "Item:Q1180542"
From MaRDI portal
The following pages link to Heuristic for rapidly four-coloring large planar graphs (Q1180542):
Displaying 4 items.
- A framework for scalable greedy coloring on distributed-memory parallel computers (Q436752) (← links)
- How false is Kempe's proof of the four color theorem? II (Q1036235) (← links)
- Transformations for maximal planar graphs with minimum degree five (Q6085725) (← links)
- Four coloring for a subset of maximal planar graphs with minimum degree five (Q6567665) (← links)