1 research outputs found

    On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions

    Get PDF
    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 k≥4k\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 k≥3k\geq 3 there exists a simple connected kk-regular graph with no separating transitions whose line graph has no Hamilton decomposition
    corecore