Excluded t-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
DOI10.1137/18M1176737zbMATH Open1486.05251OpenAlexW2740769053MaRDI QIDQ5067424FDOQ5067424
Authors: Kenjiro Takazawa 
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
Recommendations
- Excluded \(t\)-factors in bipartite graphs: a unified framework for nonbipartite matchings and restricted 2-matchings
- Restricted \(t\)-matchings in bipartite graphs
- Restricted b‐factors in bipartite graphs and t‐designs
- Publication:4503758
- scientific article; zbMATH DE number 2147779
- Generalized Matching Preclusion in Bipartite Graphs
- An extension of elementary bipartite graphs to matroid pairs and its characterization
- A note on generalized matching preclusion in bipartite graphs
- On bipartite restrictions of binary matroids
- On the maximum uniquely restricted matching for bipartite graphs
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Fibonacci heaps and their uses in improved network optimization algorithms
- Paths, Trees, and Flowers
- Matching theory
- Title not available (Why is that?)
- Optimum branchings
- Title not available (Why is that?)
- Finding 2-factors closer to TSP tours in cubic graphs
- Cycles Intersecting Edge-Cuts of Prescribed Sizes
- A matching problem with side conditions
- Restricted \(t\)-matchings in bipartite graphs
- Even factors, jump systems, and discrete convexity
- 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
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
- Finding maximum square-free 2-matchings in bipartite graphs
- A weighted \(K_{t,t}\)-free \(t\)-factor algorithm for bipartite graphs
- On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
- Combinatorial algorithms for matchings, even factors and square-free 2-factors
- Title not available (Why is that?)
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- Maximum Cardinality Simple 2-matchings in Subcubic Graphs
- Restricted \(b\)-matchings in degree-bounded graphs
- An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs
- Title not available (Why is that?)
- The optimal path-matching problem
- A Gallai–Edmonds‐type structure theorem for path‐matchings
- Note on the path‐matching formula
- On the maximum even factor in weakly symmetric graphs
- A weighted independent even factor algorithm
- A weighted even factor algorithm
- Title not available (Why is that?)
- Integer Programming and Combinatorial Optimization
- Integer Programming and Combinatorial Optimization
- Use of matroid theory in operations research, circuits and systems theory
- Title not available (Why is that?)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Improved algorithms for even factors and square-free simple \(b\)-matchings
- Maximal non- hamilton-laceable graphs
- Complexity of packing common bases in matroids
- The Independent Even Factor Problem
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
- Excluded \(t\)-factors in bipartite graphs: a unified framework for nonbipartite matchings and restricted 2-matchings
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- Title not available (Why is that?)
Cited In (5)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs
- A weighted \(K_{t,t}\)-free \(t\)-factor algorithm for bipartite graphs
- Excluded \(t\)-factors in bipartite graphs: a unified framework for nonbipartite matchings and restricted 2-matchings
- Finding triangle-free 2-factors in general graphs
This page was built for publication: Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5067424)
