54 citations · 65 across the 10 of their papers we have counts for
4 papers · 1 filter
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 …
Hamilton path decompositions of complete multipartite graphs
Darryn Bryant, Hao Chuien Hang, Sarada Herke
We prove that a complete multipartite graph with vertices and edges can be decomposed into edge-disjoint Hamilton paths if and only if is an integer an…
Steiner triple systems with high chromatic index
Darryn Bryant, Charles Colbourn, Daniel Horsley +1
It is conjectured that every Steiner triple system of order has chromatic index at most when and at most when $v \equiv 1 \pmod…
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…