English

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 33-regular graph XX is Hamilton decomposable if and only if XX is Hamiltonian, we show that for each integer k4k\geq 4 there exists a simple non-Hamiltonian kk-regular graph whose line graph has a Hamilton decomposition. We also answer a question of Jackson by showing that for each integer k3k\geq 3 there exists a simple connected kk-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}
}