Pages that link to "Item:Q2634675"
From MaRDI portal
The following pages link to Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 (Q2634675):
Displaying 4 items.
- Complexity of clique coloring and related problems (Q551168) (← links)
- Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 (Q2634675) (← links)
- Perfect graphs with no balanced skew-partition are 2-clique-colorable (Q2800540) (← links)
- (Q5405024) (redirect page) (← links)