Vertex-transitive graphs of prime-squared order are Hamilton-decomposable
Document Type
Article
Publication Date
1-2014
Department
Department of Mathematical Sciences
Abstract
We prove that all connected vertex-transitive graphs of order p 2, p a prime, can be decomposed into Hamilton cycles.
Publication Title
Journal of Combinatorial Designs
Recommended Citation
Alspach, B.,
Bryant, D.,
&
Kreher, D. L.
(2014).
Vertex-transitive graphs of prime-squared order are Hamilton-decomposable.
Journal of Combinatorial Designs,
22(1), 12-25.
http://doi.org/10.1002/jcd.21381
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/3714
Publisher's Statement
© 2013 Wiley Periodicals, Inc. Publisher’s version of record: https://doi.org/10.1002/jcd.21381