14 citations · 20 across the 8 of their papers we have counts for
Showing 2017 · math.COShow all
3 papers · 2 filters
math.CO2017
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…
math.CO2017★ 2 cited
Parity of Sets of Mutually Orthogonal Latin Squares
Nevena Francetić, Sarada Herke, Ian M. Wanless
Every Latin square has three attributes that can be even or odd, but any two of these attributes determines the third. Hence the parity of a Latin square has an information content…
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…