Tractable Feedback Vertex Sets in Restricted Bipartite Graphs
From MaRDI portal
Publication:5199168
DOI10.1007/978-3-642-22616-8_33zbMath1342.05121OpenAlexW173817153MaRDI QIDQ5199168
Publication date: 12 August 2011
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22616-8_33
Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
Solving problems on generalized convex graphs via mim-width ⋮ Circular convex bipartite graphs: feedback vertex sets ⋮ Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs ⋮ Feedback vertex sets on restricted bipartite graphs ⋮ On convexity in split graphs: complexity of Steiner tree and domination ⋮ Maximum Edge Bicliques in Tree Convex Bipartite Graphs ⋮ Two Hardness Results on Feedback Vertex Sets ⋮ Solving problems on generalized convex graphs via mim-width ⋮ Circular Convex Bipartite Graphs: Feedback Vertex Set ⋮ Tractable connected domination for restricted bipartite graphs
This page was built for publication: Tractable Feedback Vertex Sets in Restricted Bipartite Graphs
