Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
