Pages that link to "Item:Q328696"
From MaRDI portal
The following pages link to Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696):
Displaying 11 items.
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Counting independent sets and maximal independent sets in some subclasses of bipartite graphs (Q1627864) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy (Q2165280) (← links)
- Counting dominating sets in some subclasses of bipartite graphs (Q2672635) (← links)
- Induced Matching in Some Subclasses of Bipartite Graphs (Q2971661) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)
- On convexity in split graphs: complexity of Steiner tree and domination (Q6123388) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
