Restricted \(t\)-matchings in bipartite graphs
From MaRDI portal
Publication:1410687
DOI10.1016/S0166-218X(02)00461-4zbMath1022.05062OpenAlexW1973995785MaRDI QIDQ1410687
Publication date: 14 October 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00461-4
Related Items
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, Combinatorial algorithms for matchings, even factors and square-free 2-factors, Decomposition theorems for square-free 2-matchings in bipartite graphs, Triangle-free 2-matchings and M-concave functions on jump systems, A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs, An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach, Packing $k$-Matchings and $k$-Critical Graphs, A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs, A Survey on Covering Supermodular Functions, A proof of Cunningham's conjecture on restricted subgraphs and jump systems, An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs, Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs, Finding maximum square-free 2-matchings in bipartite graphs, Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings, Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs, Unnamed Item, Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
Cites Work
