2 citations · 3 across the 3 of their papers we have counts for
Showing math.COShow all
3 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 -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 -regular graph is Hamilton decomposable if and only if is Hamiltonian, we show that for each integer …
math.CO2017★ 2 cited
On Hamilton Decompositions of Infinite Circulant Graphs
Darryn Bryant, Sarada Herke, Barbara Maenhaut +1
The natural infinite analogue of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connected spanning 2-valent subgraph). Although it is known that every connected $2k…