The Independent Even Factor Problem

DOI10.1137/060657066zbMath1193.05131OpenAlexW2037079297MaRDI QIDQ3648506

Satoru Iwata, Kenjiro Takazawa

Publication date: 27 November 2009

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

Full work available at URL: https://doi.org/10.1137/060657066

zbMATH Keywords

matchingpolynomial-time algorithmmatroid intersectioneven factor

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids ⋮ Improved algorithms for even factors and square-free simple \(b\)-matchings ⋮ A weighted independent even factor algorithm

This page was built for publication: The Independent Even Factor Problem