The following pages link to (Q4028103):
Displayed 14 items.
- Finding a chain graph in a bipartite permutation graph (Q284350) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Characterizations of cographs as intersection graphs of paths on a grid (Q741533) (← links)
- Containment relations in split graphs (Q765349) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Edge Contractions in Subclasses of Chordal Graphs (Q3010431) (← links)
- When can graph hyperbolicity be computed in linear time? (Q5915992) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)