Pages that link to "Item:Q5920156"
From MaRDI portal
The following pages link to Strong triadic closure in cographs and graphs of low maximum degree (Q5920156):
Displaying 8 items.
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
- (Q5116487) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q5136273) (← links)
- On the relation of strong triadic closure and cluster deletion (Q5915591) (← links)
- Strong triadic closure in cographs and graphs of low maximum degree (Q5915633) (← links)
- Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)