On the maximum even factor in weakly symmetric graphs

DOI10.1016/j.jctb.2004.01.001zbMath1051.05072OpenAlexW2063204827MaRDI QIDQ598466

Gyula Pap, László Szegő

Publication date: 6 August 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.01.001

zbMATH Keywords

matchingsfactormatroid intersectionGallai-Edmonds-type structure theoremmin-max formulasymmetric digraphs

Mathematics Subject Classification ID

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

Related Items (7)

Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids ⋮ Combinatorial algorithms for matchings, even factors and square-free 2-factors ⋮ Improved algorithms for even factors and square-free simple \(b\)-matchings ⋮ A weighted independent even factor algorithm ⋮ Matchings of cycles and paths in directed graphs ⋮ A weighted even factor algorithm ⋮ Even factors, jump systems, and discrete convexity

Cites Work

• Matching theory
• The optimal path-matching problem
• Orthogonal structures in directed graphs
• Matching, matroids, and extensions
• Perfect matchings of a graph
• A decomposition theorem for partially ordered sets
• A Gallai–Edmonds‐type structure theorem for path‐matchings
• Note on the path‐matching formula
• Paths, Trees, and Flowers
• Unnamed Item
• Unnamed Item

This page was built for publication: On the maximum even factor in weakly symmetric graphs