scientific article; zbMATH DE number 1543064

zbMATH Open0960.68129MaRDI QIDQ4520519FDOQ4520519

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

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

graph well-quasi-orderingminor ordering

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• The birth and early years of parameterized complexity
• A basic parameterized complexity primer
• \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
• Graph minors and parameterized algorithm design
• Title not available (Why is that?)
• Vertex-minors, monadic second-order logic, and a conjecture by Seese
• Obtaining a planar graph by vertex deletion
• Minor obstructions for apex-pseudoforests

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)