Alan J. Hoffman
Linear Algebra and Its Applications
Let Mm be a matching with m edges, n≥2m. We prove that the smallest number of complete bipartite graphs which partition the edges of Kn+Mm is at least n-m+⌊2m⌋-1. © 2001 Academic Press.
Alan J. Hoffman
Linear Algebra and Its Applications
Alan J. Hoffman
Advances in Computational Mathematics
Alan J. Hoffman, Carl W. Lee
Discrete and Computational Geometry
Wolfgang W. Bein, Peter Brucker, et al.
Mathematical Programming