The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3 (Q1354146): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Using euler partitions to edge color bipartite multigraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank |
Revision as of 12:26, 27 May 2024
scientific article
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 |
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