2 citations · 3 across the 3 of their papers we have counts for
4 papers · 1 filter
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…
On determining when small embeddings of partial Steiner triple systems exist
Darryn Bryant, Ajani De Vas Gunasekara, Daniel Horsley
A partial Steiner triple system of order is a pair where is a set of elements and is a set of triples of elements of such that any t…
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 …
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…