Hamilton cycle rich two‐factorizations of complete graphs
Journal of Combinatorial Designs · 2004-01 · 12 (2) · 147-155
DOI: 10.1002/jcd.20005 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Designs, online erschienen am 22.01.2004. Verfasst von Darryn Bryant. Die Arbeit wurde bisher 18-mal zitiert (Crossref) und nennt 22 Literaturangaben.
Abstract (Originalsprache)
For all integers n ≥ 5, it is shown that the graph obtained from the n ‐cycle by joining vertices at distance 2 has a 2‐factorization is which one 2‐factor is a Hamilton cycle, and the other is isomorphic to any given 2‐regular graph of order n . This result is used to prove several results on 2‐factorizations of the complete graph K n of order n . For example, it is shown that for all odd n ≥ 11, K n has a 2‐factorization in which three of the 2‐factors are isomorphic to any three given 2‐regular graphs of order n , and the remaining 2‐factors are Hamilton cycles. For any two given 2‐regular graphs of even order n , the corresponding result is proved for the graph K n ‐ I obtained from the complete graph by removing the edges of a 1‐factor. © 2004 Wiley Periodicals, Inc.
Zitieren
APA
Bryant, D. (2004). Hamilton cycle rich two‐factorizations of complete graphs. Journal of Combinatorial Designs, 12(2), 147-155. https://doi.org/10.1002/jcd.20005
Vancouver
Bryant D. Hamilton cycle rich two‐factorizations of complete graphs. Journal of Combinatorial Designs. 2004;12(2):147-155. doi:10.1002/jcd.20005
BibTeX
@article{Bryant2004,
author = {Bryant, Darryn},
title = {Hamilton cycle rich two‐factorizations of complete graphs},
journal = {Journal of Combinatorial Designs},
year = {2004},
volume = {12},
number = {2},
pages = {147--155},
doi = {10.1002/jcd.20005}
}
EUVIMED