Restricted b-matchings in degree-bounded graphs

DOI10.1007/978-3-642-13036-6_4zbMATH Open1284.05207OpenAlexW1522552921MaRDI QIDQ3569807FDOQ3569807

Authors: Kristóf Bérczi, László A. Végh 

Publication date: 22 June 2010

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_4

Recommendations

• Restricted \(t\)-matchings in bipartite graphs
• Finding maximum square-free 2-matchings in bipartite graphs
• On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
• Maximum Cardinality Simple 2-matchings in Subcubic Graphs
• An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs

zbMATH Keywords

\(b\)-matchingsubcubic graphsquare-free\(K _{t + 1}\)-free\(K _{t, t }\)-free

Mathematics Subject Classification ID

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

Cited In (19)

• A proof of Cunningham's conjecture on restricted subgraphs and jump systems
• Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
• Decomposition theorems for square-free 2-matchings in bipartite graphs
• Restricted \(t\)-matchings in bipartite graphs
• Matchings under distance constraints. I
• Matchings under distance constraints. II.
• Restricted matching in graphs of small genus
• An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs
• A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
• Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
• Decomposition theorems for square-free 2-matchings in bipartite graphs
• Restricted Bipartite Graphs: Comparison and Hardness Results
• An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem
• Bounds on maximum \(b\)-matchings
• The traveling salesman problem on cubic and subcubic graphs
• On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
• Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
• Finding triangle-free 2-factors in general graphs
• Matching for Graphs of Bounded Degree

This page was built for publication: Restricted \(b\)-matchings in degree-bounded graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569807)