Pages that link to "Item:Q4521494"
From MaRDI portal
The following pages link to Clique-inverse graphs ofK3-free andK4-free graphs (Q4521494):
Displayed 5 items.
- Split clique graph complexity (Q393107) (← links)
- The complexity of clique graph recognition (Q1019185) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Characterization and recognition of generalized clique-Helly graphs (Q2462382) (← links)
- (Q5708502) (← links)