Tractable Feedback Vertex Sets in Restricted Bipartite Graphs
From MaRDI portal
Publication:5199168
DOI10.1007/978-3-642-22616-8_33zbMath1342.05121MaRDI 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
05C75: Structural characterization of families of graphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Maximum Edge Bicliques in Tree Convex Bipartite Graphs, 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, Solving problems on generalized convex graphs via mim-width, Tractable connected domination for restricted bipartite graphs, Circular Convex Bipartite Graphs: Feedback Vertex Set, Two Hardness Results on Feedback Vertex Sets