The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices (Q892049): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 02:30, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices |
scientific article |
Statements
The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices (English)
0 references
18 November 2015
0 references
computational complexity
0 references
edge 3-colorability
0 references
hereditary class
0 references
efficient algorithm
0 references
