Document Type
Article
Subject Area(s)
Mathematics
Abstract
In this paper it is shown that if G is a connected graph of order 2n (n > 1) not containing a 1-factor, then for each k, 1
Publication Info
Proceedings of the American Mathematical Society, Volume 42, Issue 1, 1974, pages 8-12.
Rights
© 1974 by American Mathematical Society