Pages that link to "Item:Q1920227"
From MaRDI portal
The following pages link to Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs (Q1920227):
Displaying 31 items.
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186) (← links)
- Feedback vertex set in hypercubes (Q294845) (← links)
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- Minimum feedback vertex sets in shuffle-based interconnection networks (Q1007599) (← links)
- Feedback vertex sets in star graphs (Q1029080) (← links)
- A linear time algorithm for the minimum weighted feedback vertex set on diamonds (Q1041719) (← links)
- Almost exact minimum feedback vertex set in meshes and butterflies (Q1129019) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- The integrity of a cubic graph (Q1827848) (← links)
- New bounds on the size of the minimum feedback vertex set in meshes and butterflies. (Q1853082) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Feedback vertex sets in mesh-based networks (Q2383604) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs (Q2914318) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- Feedback vertex set on cocomparability graphs (Q4894873) (← links)
- (Q5009483) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- Decycling bipartite graphs (Q5084689) (← links)
- (Q5503334) (← links)
- (Q5708559) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)
- Connected feedback vertex set on AT-free graphs (Q6658085) (← links)
- Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)
