Factorizations of the complete graph into C-5-factors and 1-factors

Adams, P, Bryant, D, El-Zanati, SI and Gavlas, H (2003) Factorizations of the complete graph into C-5-factors and 1-factors. Graphs And Combinatorics, 19 3: 289-296. doi:10.1007/s00373-002-0509-5


Author Adams, P
Bryant, D
El-Zanati, SI
Gavlas, H
Title Factorizations of the complete graph into C-5-factors and 1-factors
Journal name Graphs And Combinatorics   Check publisher's open access policy
ISSN 0911-0119
Publication date 2003-01-01
Sub-type Article (original research)
DOI 10.1007/s00373-002-0509-5
Volume 19
Issue 3
Start page 289
End page 296
Total pages 17
Editor J. Akiyama
M. Kano
Place of publication Japan
Publisher Springer-Verlag Tokyo
Language eng
Subject C1
230101 Mathematical Logic, Set Theory, Lattices And Combinatorics
780101 Mathematical sciences
Abstract In this paper, we show that K-10n can be factored into alpha C-5-factors and beta 1-factors for all non-negative integers alpha and beta satisfying 2alpha + beta = 10(n) - 1.
Keyword Mathematics
Oberwolfach Problem
Q-Index Code C1

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 1 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 1 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Wed, 15 Aug 2007, 05:24:32 EST