Restricted b-Matchings in Degree-Bounded Graphs

DOI10.1007/978-3-642-13036-6_4zbMath1284.05207OpenAlexW1522552921MaRDI QIDQ3569807

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

zbMATH Keywords

square-free\(b\)-matchingsubcubic graph\(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)

Related Items (10)

Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles ⋮ Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids ⋮ Decomposition theorems for square-free 2-matchings in bipartite graphs ⋮ A proof of Cunningham's conjecture on restricted subgraphs and jump systems ⋮ An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs ⋮ The traveling salesman problem on cubic and subcubic graphs ⋮ Matchings under distance constraints. I ⋮ A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges ⋮ Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs ⋮ Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles

This page was built for publication: Restricted b-Matchings in Degree-Bounded Graphs