Feedback Vertex Sets on Tree Convex Bipartite Graphs

DOI10.1007/978-3-642-31770-5_9zbMath1301.05343OpenAlexW1020382673MaRDI QIDQ3167352

Chaoyi Wang, Tian Liu, Wei Jiang, Ke Xu

Publication date: 2 November 2012

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31770-5_9

Mathematics Subject Classification ID

Combinatorial optimization (90C27) 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 ⋮ 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 ⋮ Tractable connected domination for restricted bipartite graphs

This page was built for publication: Feedback Vertex Sets on Tree Convex Bipartite Graphs