Complexity of clique-coloring odd-hole-free graphs (Q3652547)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of clique-coloring odd-hole-free graphs |
scientific article |
Statements
Complexity of clique-coloring odd-hole-free graphs (English)
0 references
18 December 2009
0 references
clique chromatic number
0 references
clique-coloring
0 references
hole
0 references
odd-hole-free graphs
0 references
co-diamond
0 references
co-diamond free graphs
0 references
