The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices (Q892049)
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 complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices |
scientific article; zbMATH DE number 6510930
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices |
scientific article; zbMATH DE number 6510930 |
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
0.8583531975746155
0 references
0.8513563871383667
0 references
0.8239928483963013
0 references
0.8125720620155334
0 references
