Pages that link to "Item:Q496003"
From MaRDI portal
The following pages link to Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003):
Displayed 8 items.
- Cluster deletion on interval graphs and split related graphs (Q2037103) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
- A new approximate cluster deletion algorithm for diamond-free graphs (Q2292150) (← links)
- (Q5092370) (← links)
- (Q5136273) (← links)
- Strong triadic closure in cographs and graphs of low maximum degree (Q5915633) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) (← links)
- Structural parameterization of cluster deletion (Q6070784) (← links)