scientific article; zbMATH DE number 1543064

zbMath0960.68129MaRDI QIDQ4520519

Michael R. Fellows, Rodney G. Downey

Publication date: 26 February 2001

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph well-quasi-orderingminor ordering

Mathematics Subject Classification ID

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

Related Items (8)

The Birth and Early Years of Parameterized Complexity ⋮ A Basic Parameterized Complexity Primer ⋮ Graph Minors and Parameterized Algorithm Design ⋮ Vertex-minors, monadic second-order logic, and a conjecture by Seese ⋮ Effective computation of immersion obstructions for unions of graph classes ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Obtaining a planar graph by vertex deletion ⋮ Minor obstructions for apex-pseudoforests

This page was built for publication: