Pages that link to "Item:Q5931421"
From MaRDI portal
The following pages link to Forbidden minors to graphs with small feedback sets (Q5931421):
Displaying 20 items.
- Outerplanar obstructions for a feedback vertex set (Q412287) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Forbidden minors for graphs with no first obstruction to parametric Feynman integration (Q482194) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- Minor-obstructions for apex sub-unicyclic graphs (Q777436) (← links)
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width (Q1322236) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- Minor obstructions for apex-pseudoforests (Q2043398) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Properties of vertex cover obstructions (Q2455575) (← links)
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders (Q2828222) (← links)
- Outerplanar obstructions for the feedback vertex set (Q2851458) (← links)
- On characterizations by nice forbidding sets (Q2857350) (← links)
- A note on the computability of graph minor obstruction sets for monadic second order ideals (Q4520519) (← links)
- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed (Q4645287) (← links)
- On constructing obstruction sets of words (Q4713368) (← links)
- Obstructions to within a few vertices or edges of acyclic (Q5057453) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Minor-obstructions for apex sub-unicyclic graphs (Q6621238) (← links)
