arXiv:1710.06037 [math.CO]AbstractReferencesReviewsResources
On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions
Darryn Bryant, Barbara Maenhaut, Benjamin R. Smith
Published 2017-10-17Version 1
In contrast with Kotzig's result that the line graph of a $3$-regular graph $X$ is Hamilton decomposable if and only if $X$ is Hamiltonian, we show that for each integer $k\geq 4$ there exists a simple non-Hamiltonian $k$-regular graph whose line graph has a Hamilton decomposition. We also answer a question of Jackson by showing that for each integer $k\geq 3$ there exists a simple connected $k$-regular graph with no separating transitions whose line graph has no Hamilton decomposition.
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1408.5211 [math.CO] (Published 2014-08-22)
Vertex-transitive graphs that have no Hamilton decomposition
arXiv:2012.00988 [math.CO] (Published 2020-12-02)
Hamilton decompositions of line graphs
arXiv:2312.09873 [math.CO] (Published 2023-12-15)
A note on Hamilton decompositions of even-regular multigraphs