1 citations · 1 across the 2 of their papers we have counts for
3 papers
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.CO2015
Decompositions of complete multigraphs into cycles of varying lengths
Darryn Bryant, Daniel Horsley, Barbara Maenhaut +1
We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint…