Finding maximum square-free 2-matchings in bipartite graphs
Author:
- David HartvigsenDHDavid Hartvigsen
- 1 September 2006
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 96 (5) , 693-705
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Restricted t-matchings in bipartite graphsDiscrete Applied Mathematics, 2003
- Matching, matroids, and extensionsMathematical Programming, 2002
- On Restricted Two-FactorsSIAM Journal on Discrete Mathematics, 1988
- A matching problem with side conditionsDiscrete Mathematics, 1980
- An NP-hard problem in bipartite graphsACM SIGACT News, 1975
- Lehmans switching game and a theorem of Tutte and Nash-WilliamsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- A Short Proof of the Factor Theorem for Finite GraphsCanadian Journal of Mathematics, 1954
- The Factors of GraphsCanadian Journal of Mathematics, 1952
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947