Feedback Vertex Sets on Tree Convex Bipartite Graphs
From MaRDI portal
(Redirected from 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
(16)- Solving problems on generalized convex graphs via mim-width
- Circular convex bipartite graphs: feedback vertex set
- On the feedback vertex set polytope of a series-parallel graph
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs
- Circular convex bipartite graphs: feedback vertex sets
- Feedback vertex sets on restricted bipartite graphs
- On the complexity of computing treebreadth
- On the complexity of computing treebreadth
- Solving problems on generalized convex graphs via mim-width
- Finding maximum edge bicliques in tree convex graphs
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- Total domination and open packing in some subclasses of bipartite graphs
- Tractable feedback vertex sets in restricted bipartite graphs
- Feedback vertex set on cocomparability graphs
- Approximation hardness of domination problems on generalized convex graphs
- Tractable connected domination for restricted bipartite 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)
