Complexity separating classes for edge-colouring and total-colouring (Q2391946)
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: Complexity separating classes for edge-colouring and total-colouring |
scientific article; zbMATH DE number 6195234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity separating classes for edge-colouring and total-colouring |
scientific article; zbMATH DE number 6195234 |
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
0.8782965540885925
0 references
0.856314480304718
0 references
0.8540797829627991
0 references
0.8509301543235779
0 references
0.8215261101722717
0 references
