Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
DOI10.1137/18M1176737zbMath1486.05251OpenAlexW2740769053MaRDI QIDQ5067424
Publication date: 1 April 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1176737
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangle-free 2-matchings and M-concave functions on jump systems
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs
- On the maximum even factor in weakly symmetric graphs
- Combinatorial algorithms for matchings, even factors and square-free 2-factors
- A weighted even factor algorithm
- A matching problem with side conditions
- The optimal path-matching problem
- Restricted \(t\)-matchings in bipartite graphs
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Improved algorithms for even factors and square-free simple \(b\)-matchings
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
- Complexity of packing common bases in matroids
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- Excluded \(t\)-factors in bipartite graphs: a unified framework for nonbipartite matchings and restricted 2-matchings
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- A weighted independent even factor algorithm
- Finding maximum square-free 2-matchings in bipartite graphs
- Even factors, jump systems, and discrete convexity
- Finding 2-Factors Closer to TSP Tours in Cubic Graphs
- Maximum Cardinality Simple 2-matchings in Subcubic Graphs
- A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
- Cycles Intersecting Edge-Cuts of Prescribed Sizes
- On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
- Restricted b-Matchings in Degree-Bounded Graphs
- The Independent Even Factor Problem
- Use of matroid theory in operations research, circuits and systems theory
- Maximal non- hamilton-laceable graphs
- A Gallai–Edmonds‐type structure theorem for path‐matchings
- Note on the path‐matching formula
- Fibonacci heaps and their uses in improved network optimization algorithms
- Paths, Trees, and Flowers
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
- Optimum branchings
- Integer Programming and Combinatorial Optimization
- Integer Programming and Combinatorial Optimization
This page was built for publication: Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
