On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions
Combinatorics
2017-10-18 v1
Abstract
In contrast with Kotzig's result that the line graph of a -regular graph is Hamilton decomposable if and only if is Hamiltonian, we show that for each integer there exists a simple non-Hamiltonian -regular graph whose line graph has a Hamilton decomposition. We also answer a question of Jackson by showing that for each integer there exists a simple connected -regular graph with no separating transitions whose line graph has no Hamilton decomposition.
Keywords
Cite
@article{arxiv.1710.06037,
title = {On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions},
author = {Darryn Bryant and Barbara Maenhaut and Benjamin R. Smith},
journal= {arXiv preprint arXiv:1710.06037},
year = {2017}
}