Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 (Q2634675)
From MaRDI portal
scientific article; zbMATH DE number 6275992
- Hierarchical Complexity of 2-Clique-Colouring Weakly Chordal Graphs and Perfect Graphs Having Cliques of Size at Least 3
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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 6275992 |
|
Statements
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 (English)
0 references
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
31 March 2014
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
\((\alpha, \beta)\)-polar graphs
0 references
