Pages that link to "Item:Q5199168"
From MaRDI portal
The following pages link to Tractable Feedback Vertex Sets in Restricted Bipartite Graphs (Q5199168):
Displayed 10 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← 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)