Coloring algorithms for \(K_ 5\)-minor free graphs (Q910220)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4139293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring algorithms for \(K_ 5\)-minor free graphs |
scientific article; zbMATH DE number 4139293 |
Statements
Coloring algorithms for \(K_ 5\)-minor free graphs (English)
0 references
1990
0 references
graph minors
0 references
parallel algorithms
0 references
planar graph coloring
0 references
0 references
0.8349064588546753
0 references
0.8207131028175354
0 references
0.8082700967788696
0 references
0.7728987336158752
0 references
0.7681224346160889
0 references
