Minimal edge-coverings of pairs of sets
Journal of Combinatorial Theory Series B
The Square-Free 2-Factor Problem in Bipartite Graphs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Restricted t-matchings in bipartite graphs
Discrete Applied Mathematics - Submodularity
Finding maximum square-free 2-matchings in bipartite graphs
Journal of Combinatorial Theory Series B
On Maximum Cost $K_{t,t}$-Free $t$-Matchings of Bipartite Graphs
SIAM Journal on Discrete Mathematics
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
Mathematics of Operations Research
A proof of Cunningham's conjecture on restricted subgraphs and jump systems
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |
We present a min-max formula and a polynomial time algorithm for a slight generalization of the following problem: in a simple undirected graph in which the degree of each node is at most t+1, find a maximum t-matching containing no member of a list $\mathcal{K}$ of forbidden Kt,t and Kt+1 subgraphs. An analogous problem for bipartite graphs without degree bounds was solved by Makai [15], while the special case of finding a maximum square-free 2-matching in a subcubic graph was solved in [1].