scientific article; zbMATH DE number 1554933

MaRDI QIDQ4525262zbMATH OpenFDO

Authors Kevin Cattell, Michael J. Dinneen

Publication date 21 January 2001

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 1696634
• Minor‐order obstructions for the graphs of vertex cover 6
• Properties of vertex cover obstructions
• scientific article; zbMATH DE number 1830723
• On computing graph minor obstruction sets

Cited in

(12)

• Properties of vertex cover obstructions
• Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
• On computing graph minor obstruction sets
• Halin's theorem for cubic graphs on an annulus
• scientific article; zbMATH DE number 1696634 (Why is no real title available?)
• scientific article; zbMATH DE number 1830723 (Why is no real title available?)
• Minor‐order obstructions for the graphs of vertex cover 6
• Connected vertex cover for \((sP_1+P_5)\)-free graphs
• Sparse obstructions for minor-covering parameters
• Dichotomy results for fixed point counting in Boolean dynamical systems
• Obstructions to within a few vertices or edges of acyclic
• A simple linear-time algorithm for finding path-decompositions of small width

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