Fast algorithms for edge-coloring planar graphs (Q3815319)
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 4085676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for edge-coloring planar graphs |
scientific article; zbMATH DE number 4085676 |
Statements
Fast algorithms for edge-coloring planar graphs (English)
0 references
1989
0 references
edge-coloring
0 references
algorithms
0 references
planar graph
0 references
optimal coloring
0 references
0.9248379468917848
0 references
0.9245321750640868
0 references
0.9178085923194884
0 references
0.8990476131439209
0 references