scientific article; zbMATH DE number 1543064

MaRDI QIDQ4520519zbMATH OpenFDO

Authors Michael R. Fellows, Rodney G. Downey, Bruno Courcelle

Publication date 26 February 2001

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

zbMATH Keywords

graph well-quasi-orderingminor ordering

Mathematics Subject Classification ID

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

Recommendations

• On computing graph minor obstruction sets
• Forbidden minors to graphs with small feedback sets
• scientific article; zbMATH DE number 10087
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues

Cited in

(11)

• On computing graph minor obstruction sets
• Minor obstructions for apex-pseudoforests
• Obtaining a planar graph by vertex deletion
• The birth and early years of parameterized complexity
• A basic parameterized complexity primer
• Graph minors and parameterized algorithm design
• scientific article; zbMATH DE number 4110103 (Why is no real title available?)
• scientific article; zbMATH DE number 1543076 (Why is no real title available?)
• k-apices of minor-closed graph classes. I: Bounding the obstructions
• Graph parameters, universal obstructions, and WQO
• Vertex-minors, monadic second-order logic, and a conjecture by Seese

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 Q4520519)