Pages that link to "Item:Q896655"
From MaRDI portal
The following pages link to Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655):
Displaying 4 items.
- Finding a chain graph in a bipartite permutation graph (Q284350) (← links)
- Families of nested graphs with compatible symmetric-group actions (Q2335508) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
