Pages that link to "Item:Q3167352"
From MaRDI portal
The following pages link to Feedback Vertex Sets on Tree Convex Bipartite Graphs (Q3167352):
Displaying 13 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)
- On the feedback vertex set polytope of a series-parallel graph (Q834183) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- On the Complexity of Computing Treebreadth (Q2819486) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- Feedback vertex set on cocomparability graphs (Q4894873) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)
