The complete spectrum of 6‐cycle systems of l(k n )
Journal of Combinatorial Designs · 1995-01 · 3 (5) · 353-362
DOI: 10.1002/jcd.3180030506 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Designs, online erschienen am 14.11.2006. Verfasst von B. A. Cox. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 15 Literaturangaben.
Abstract (Originalsprache)
In this article, it is shown that a decomposition of the line graph of the complete graph on n vertices into cycles of length 6 exist if and only if n ≢ 3 (mod 4). © 1995 John Wiley & Sons, Inc.
Zitieren
APA
Cox, B. A. (1995). The complete spectrum of 6‐cycle systems of l(k n ). Journal of Combinatorial Designs, 3(5), 353-362. https://doi.org/10.1002/jcd.3180030506
Vancouver
Cox BA. The complete spectrum of 6‐cycle systems of l(k n ). Journal of Combinatorial Designs. 1995;3(5):353-362. doi:10.1002/jcd.3180030506
BibTeX
@article{Cox1995,
author = {Cox, B. A.},
title = {The complete spectrum of 6‐cycle systems of l(k n )},
journal = {Journal of Combinatorial Designs},
year = {1995},
volume = {3},
number = {5},
pages = {353--362},
doi = {10.1002/jcd.3180030506}
}
EUVIMED