Article ID Journal Published Year Pages File Type
6424552 Journal of Combinatorial Theory, Series B 2015 10 Pages PDF
Abstract

It is shown that there are infinitely many connected vertex-transitive graphs that have no Hamilton decomposition, including infinitely many Cayley graphs of valency 6, and including Cayley graphs of arbitrarily large valency.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Vertex-transitive graphs that have no Hamilton decomposition
Authors
, ,