Pages that link to "Item:Q2354310"
From MaRDI portal
The following pages link to Tractable connected domination for restricted bipartite graphs (Q2354310):
Displaying 9 items.
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Domination in some subclasses of bipartite graphs (Q1630774) (← links)
- Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
- Traceability of connected domination critical graphs (Q2656675) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)
