Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654)
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 of colouring problems restricted to unichord-free and square, unichord-free graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs |
scientific article |
Statements
Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (English)
0 references
22 September 2015
0 references
graph algorithms
0 references
complexity
0 references
colouring
0 references
unichord free
0 references
0 references
0.9211779832839966
0 references
0.9139482975006104
0 references
0.8509301543235779
0 references
0.8389736413955688
0 references
0.8292911648750305
0 references
