scientific article; zbMATH DE number 1543076

MaRDI QIDQ4520532zbMATH OpenFDO

Authors Michael J. Dinneen

Publication date 26 February 2001

Full work available at URL http://www.jucs.org/jucs_3_11/too_many_minor_order

zbMATH Keywords

parameterized graph problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On computing graph minor obstruction sets
• scientific article; zbMATH DE number 475617
• Upper bounds on the size of obstructions and intertwines
• Forbidden minors to graphs with small feedback sets
• scientific article; zbMATH DE number 1543064

Cited in

(15)

• Minor obstructions for apex-pseudoforests
• Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
• Sparse obstructions for minor-covering parameters
• Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
• FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders
• Outerplanar obstructions for the feedback vertex set
• Graph minors and parameterized algorithm design
• Surfing with Rod
• Outerplanar obstructions for a feedback vertex set
• k-apices of minor-closed graph classes. I: Bounding the obstructions
• Minor-obstructions for apex sub-unicyclic graphs
• Delineating half-integrality of the Erdős-Pósa property for minors: the case of surfaces
• Vertex identification to a forest
• An overview of universal obstructions for graph parameters
• Minor-obstructions for apex sub-unicyclic graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520532)