Pages that link to "Item:Q456655"
From MaRDI portal
The following pages link to Subgraph isomorphism in graph classes (Q456655):
Displaying 11 items.
- Finding a chain graph in a bipartite permutation graph (Q284350) (← 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)
- Algorithmic problems in right-angled Artin groups: complexity and applications (Q1628497) (← links)
- Notes on integer partitions (Q2076966) (← links)
- A time-based solution for the graph isomorphism problem (Q2192286) (← links)
- (Q4422264) (← links)
- (Q4882473) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
- Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes (Q6549667) (← links)
