14 citations · 20 across the 8 of their papers we have counts for
7 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…
MAX for -independence in multigraphs
Nevena Francetić, Sara Herke, Daniel Horsley
For a fixed positive integer , a set of vertices of a graph or multigraph is called a -independent set if the subgraph induced by has maximum degree less than . Th…
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…
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…
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…
On Ryser's Conjecture for Linear Intersecting Multipartite Hypergraphs
Nevena Francetić, Sarada Herke, Brendan D. McKay +1
Ryser conjectured that for -partite hypergraphs, where is the covering number and is the matching number. We prove this conjecture for in the specia…