Pages that link to "Item:Q476868"
From MaRDI portal
The following pages link to Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868):
Displaying 13 items.
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- On the complexity of various parameterizations of common induced subgraph isomorphism (Q2405897) (← links)
- Labelled well-quasi-order for permutation classes (Q5051473) (← links)
- (Q5075828) (← links)
- (Q5111878) (← links)
- Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree (Q5859738) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5918620) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← links)
- Linear-time recognition of double-threshold graphs (Q5970798) (← links)
- (Q6065396) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
