4-edge-coloring graphs of maximum degree 3 in linear time (Q1603501)
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 1767407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 4-edge-coloring graphs of maximum degree 3 in linear time |
scientific article; zbMATH DE number 1767407 |
Statements
4-edge-coloring graphs of maximum degree 3 in linear time (English)
0 references
14 July 2002
0 references
edge-coloring
0 references
cubic graphs
0 references
NP-completeness
0 references
algorithms
0 references
0.8166583776473999
0 references
0.8133383989334106
0 references
0.7865684032440186
0 references
