The following pages link to On clique-complete graphs (Q1382831):
Displaying 13 items.
- Split clique graph complexity (Q393107) (← links)
- Contractibility and the clique graph operator (Q932670) (← links)
- The complexity of clique graph recognition (Q1019185) (← links)
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- The clique operator on cographs and serial graphs (Q1827743) (← links)
- Biclique graphs of split graphs (Q2091808) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- Clique-critical graphs: maximum size and recognition (Q2500528) (← links)
- Characterization and recognition of Helly circular-arc clique-perfect graphs (Q3439325) (← links)
- Iterated Clique Graphs and Contractibility (Q3503563) (← links)
- (Q5708479) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
