Excluded t-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
From MaRDI portal
Publication:5067424
Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)
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
Cites work
- A Gallai–Edmonds‐type structure theorem for path‐matchings
- A matching problem with side conditions
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
- A weighted \(K_{t,t}\)-free \(t\)-factor algorithm for bipartite graphs
- A weighted even factor algorithm
- A weighted independent even factor algorithm
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- An algorithm for finding a maximum t-matching excluding complete partite subgraphs
- Combinatorial algorithms for matchings, even factors and square-free 2-factors
- Complexity of packing common bases in matroids
- Cycles Intersecting Edge-Cuts of Prescribed Sizes
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- Even factors, jump systems, and discrete convexity
- Excluded \(t\)-factors in bipartite graphs: a unified framework for nonbipartite matchings and restricted 2-matchings
- Fibonacci heaps and their uses in improved network optimization algorithms
- Finding 2-factors closer to TSP tours in cubic graphs
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Finding maximum square-free 2-matchings in bipartite graphs
- scientific article; zbMATH DE number 5888314 (Why is no real title available?)
- scientific article; zbMATH DE number 3708451 (Why is no real title available?)
- scientific article; zbMATH DE number 3750964 (Why is no real title available?)
- scientific article; zbMATH DE number 3637616 (Why is no real title available?)
- scientific article; zbMATH DE number 3641471 (Why is no real title available?)
- scientific article; zbMATH DE number 2086910 (Why is no real title available?)
- scientific article; zbMATH DE number 3285076 (Why is no real title available?)
- Improved algorithms for even factors and square-free simple \(b\)-matchings
- Integer Programming and Combinatorial Optimization
- Integer Programming and Combinatorial Optimization
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
- Matching theory
- Maximal non- hamilton-laceable graphs
- Maximum Cardinality Simple 2-matchings in Subcubic Graphs
- Note on the path‐matching formula
- On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
- On the maximum even factor in weakly symmetric graphs
- Optimum branchings
- Paths, Trees, and Flowers
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- Restricted b-matchings in degree-bounded graphs
- Restricted \(t\)-matchings in bipartite graphs
- The Independent Even Factor Problem
- The optimal path-matching problem
- Triangle-free 2-matchings and M-concave functions on jump systems
- Use of matroid theory in operations research, circuits and systems theory
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
Cited in
(6)- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Excluded \(t\)-factors in bipartite graphs: a unified framework for nonbipartite matchings and restricted 2-matchings
- A weighted \(K_{t,t}\)-free \(t\)-factor algorithm for bipartite graphs
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs
- Finding triangle-free 2-factors in general graphs
- Finding a maximum restricted \(t\)-matching via Boolean edge-CSP
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)
