The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3 (Q1354146)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3 |
scientific article; zbMATH DE number 1006501
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3 |
scientific article; zbMATH DE number 1006501 |
Statements
The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3 (English)
0 references
12 November 1997
0 references
As is known the problem of determining the chromatic index of a cubic graph is NP-complete. In this paper, it is shown that for a triangle free graph with maximum vertex of degree 3, to determine if its chromatic index is 3 or 4 is still NP-complete.
0 references
graph
0 references
edge-coloring
0 references
chromatic index
0 references
NP-completeness
0 references
