Complexity separating classes for edge-colouring and total-colouring (Q2391946)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity separating classes for edge-colouring and total-colouring |
scientific article |
Statements
Complexity separating classes for edge-colouring and total-colouring (English)
0 references
6 August 2013
0 references
theoretical computer science
0 references
computational complexity
0 references
colouring of graphs
0 references
total chromatic number
0 references
bipartite unichord-free
0 references
