Back to Search
Start Over
Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars.
- Source :
-
Discrete Mathematics . Oct2013, Vol. 313 Issue 20, p2354-2358. 5p. - Publication Year :
- 2013
-
Abstract
- Abstract: Let denote a cycle of length , and let denote a star with edges. For graphs , , and , a of is a decomposition of into copies of and using at least one of each. In this paper, necessary and sufficient conditions for the existence of a -decomposition of the complete bipartite graph with a 1-factor removed are given. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 313
- Issue :
- 20
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 89607214
- Full Text :
- https://doi.org/10.1016/j.disc.2013.06.014