4-edge-coloring graphs of maximum degree 3 in linear time (Q1603501): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00221-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2046410178 / rank | |||
Normal rank | |||
Latest revision as of 11:12, 30 July 2024
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
