Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 (Q6828678)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6542065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 |
scientific article; zbMATH DE number 6542065 |
Statements
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 (English)
0 references
18 February 2016
0 references
clique-colouring
0 references
hierarchical complexity
0 references
perfect graphs
0 references
weakly chordal graphs
0 references
(alpha, beta)-polar graphs
0 references
