4-edge-coloring graphs of maximum degree 3 in linear time (Q1603501)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 4-edge-coloring graphs of maximum degree 3 in linear time |
scientific article |
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
