Pages that link to "Item:Q944750"

The following pages link to Feedback vertex set on AT-free graphs (Q944750):

Displaying 19 items.

• Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
• Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
• Degenerate matchings and edge colorings (Q1706114) (← links)
• Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
• Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
• Faster exact algorithms for some terminal set problems (Q2361353) (← links)
• Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
• Feedback vertex set on Hamiltonian graphs (Q2672436) (← links)
• Minimum weight feedback vertex sets in circle \(n\)-gon graphs and circle trapezoid graphs (Q2890989) (← links)
• Proper Interval Vertex Deletion (Q3058706) (← links)
• A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width (Q3304141) (← links)
• (Q5009483) (← links)
• Graph-Theoretic Concepts in Computer Science (Q5902531) (← links)
• Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
• Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
• Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)
• Graphs with at most two moplexes (Q6595515) (← links)
• Asteroidal sets and dominating paths (Q6606182) (← links)
• Connected feedback vertex set on AT-free graphs (Q6658085) (← links)