The following pages link to Cleaning interval graphs (Q1939654):
Displaying 9 items.
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Twin-width II: small classes (Q5051371) (← links)
- (Q5111878) (← links)