Properties of vertex cover obstructions

DOI10.1016/j.disc.2007.01.003zbMath1128.05042OpenAlexW1988637379MaRDI QIDQ2455575

Rongwei Lai, Michael J. Dinneen

Publication date: 25 October 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.01.003

zbMATH Keywords

obstructionsvertex coverforbidden graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Related Items (6)

Colourings, homomorphisms, and partitions of transitive digraphs ⋮ Sparse obstructions for minor-covering parameters ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Confronting intractability via parameters ⋮ Minor obstructions for apex-pseudoforests ⋮ FPT is characterized by useful obstruction sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On computing graph minor obstruction sets
• Solving large FPT problems on coarse-grained parallel machines
• Vertex Cover: Further Observations and Further Improvements
• On Representatives of Subsets
• Minor‐order obstructions for the graphs of vertex cover 6
• Forbidden minors to graphs with small feedback sets

This page was built for publication: Properties of vertex cover obstructions