Vertex-transitive graphs that have no Hamilton decomposition

Bryant, Darryn and Dean, Matthew (2015) Vertex-transitive graphs that have no Hamilton decomposition. Journal of Combinatorial Theory. Series B, 114 237-246. doi:10.1016/j.jctb.2015.05.007


Author Bryant, Darryn
Dean, Matthew
Title Vertex-transitive graphs that have no Hamilton decomposition
Journal name Journal of Combinatorial Theory. Series B   Check publisher's open access policy
ISSN 1096-0902
0095-8956
Publication date 2015-09
Year available 2015
Sub-type Article (original research)
DOI 10.1016/j.jctb.2015.05.007
Open Access Status Not yet assessed
Volume 114
Start page 237
End page 246
Total pages 10
Place of publication Maryland Heights, United States
Publisher Academic Press
Collection year 2016
Language eng
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.
Keyword Hamilton decompositions
Hamilton cycles
Vertex-transitive graphs
Cayley graphs
Q-Index Code C1
Q-Index Status Confirmed Code
Institutional Status UQ

Document type: Journal Article
Sub-type: Article (original research)
Collections: School of Mathematics and Physics
Official 2016 Collection
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Tue, 09 Jun 2015, 02:48:26 EST by System User on behalf of Scholarly Communication and Digitisation Service