Feedback Vertex Sets on Tree Convex Bipartite Graphs
From MaRDI portal
Publication:3167352
Recommendations
- Feedback vertex sets on restricted bipartite graphs
- Tractable feedback vertex sets in restricted bipartite graphs
- Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
- Circular convex bipartite graphs: feedback vertex sets
- Feedback vertex set on planar graphs
- Circular convex bipartite graphs: feedback vertex set
- Feedback vertex set on cocomparability graphs
- Feedback vertex set in mixed graphs
- On feedback vertex set: new measure and new structures
- On the feedback vertex set problem for a planar graph
Cited in
(14)- Tractable connected domination for restricted bipartite graphs
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs
- Solving problems on generalized convex graphs via mim-width
- On the complexity of computing treebreadth
- On the complexity of computing treebreadth
- Circular convex bipartite graphs: feedback vertex set
- Feedback vertex sets on restricted bipartite graphs
- On the feedback vertex set polytope of a series-parallel graph
- Feedback vertex set on cocomparability graphs
- Solving problems on generalized convex graphs via mim-width
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- Tractable feedback vertex sets in restricted bipartite graphs
- Circular convex bipartite graphs: feedback vertex sets
- Approximation hardness of domination problems on generalized convex graphs
This page was built for publication: Feedback Vertex Sets on Tree Convex Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167352)
