Restricted b-Matchings in Degree-Bounded Graphs
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 43-56
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Augmenting undirected node-connectivity by one2010
- A Weighted kt, t-Free t-Factor Algorithm for Bipartite GraphsMathematics of Operations Research, 2009
- Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)2007
- On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite GraphsSIAM Journal on Discrete Mathematics, 2007
- Finding maximum square-free 2-matchings in bipartite graphsJournal of Combinatorial Theory, Series B, 2006
- Restricted t-matchings in bipartite graphsDiscrete Applied Mathematics, 2003
- The Square-Free 2-Factor Problem in Bipartite Graphs1999
- Minimal Edge-Coverings of Pairs of SetsJournal of Combinatorial Theory, Series B, 1995
- An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems1983
- A matching problem with side conditionsDiscrete Mathematics, 1980