Recognizing a totally odd K₄-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements

MaRDI QIDQ5417627zbMATH OpenFDO

Authors Ken-ichi Kawarabayashi, Zhentao Li, Bruce Reed

Publication date 22 May 2014

zbMATH Keywords

divide and conquerparity disjoint paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A nearly linear time algorithm for the half integral parity disjoint paths packing problem
• Edge-disjoint odd cycles in 4-edge-connected graphs
• scientific article; zbMATH DE number 1342091
• Graph minors. XIII: The disjoint paths problem
• Odd cycle packing

Cited in

(11)

• scientific article; zbMATH DE number 7053391 (Why is no real title available?)
• Counting \(K_4\)-subdivisions
• Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs
• Combing a Linkage in an Annulus
• A more accurate view of the flat wall theorem
• Parameterized algorithms for list \(K\)-cycle
• Odd \(K_{3,3}\) subdivisions in bipartite graphs
• Graph minors and parameterized algorithm design
• On the complexity of the flow coloring problem
• Claw-free \(t\)-perfect graphs can be recognized in polynomial time
• Tight bounds for divisible subdivisions

This page was built for publication: Recognizing a totally odd \(K_{4}\)-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417627)