Benjamin R. Smith

most citedHamilton decompositions of line graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2020★ 1 cited

Hamilton decompositions of line graphs

Darryn Bryant, Sara Herke, Barbara Maenhaut +1

It is proved that if a graph is regular of even degree and contains a Hamilton cycle, or regular of odd degree and contains a Hamiltonian $3$ -factor, then its line graph is Hamilto…

math.CO2017

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

Darryn Bryant, Barbara Maenhaut, Benjamin R. Smith

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$ …