AbstractA perfect 1-factorisation of a graph G is a decomposition of G into edge disjoint 1-factors such that the union of any two of the factors is a Hamiltonian cycle. Let p⩾11 be prime. We demonstrate the existence of two non-isomorphic perfect 1-factorisations of Kp+1 (one of which is well known) and five non-isomorphic perfect 1-factorisations of Kp,p. If 2 is a primitive root modulo p, then we show the existence of 11 non-isomorphic perfect 1-factorisations of Kp,p and 5 main classes of atomic Latin squares of order p. Only three of these main classes were previously known. One of the two new main classes has a trivial autotopy group
AbstractThe following problem has arisen in the study of graphs, lattices and finite topologies. Is ...
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...
A 1-factorization of a graph G is a decomposition of G into edge-disjoint 1-factors (perfect matchin...
A perfect 1-factorisation of a graph G is a decomposition of G into edge disjoint 1-factors such tha...
A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cy...
AbstractA 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamilt...
AbstractA perfect 1-factorisation of a graph G is a decomposition of G into edge disjoint 1-factors ...
Abstract: A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect ma...
A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect matchings. T...
We report the results of a computer enumeration that found that there are 3155 perfect 1-factorisati...
A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists ...
Atomic latin squares have indivisible structure which mimics that of the cyclic groups of prime orde...
A 1-factorization M = {M_1,M_2,...,M_n} of a graph G is called perfect if the union of any pair of 1...
A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into...
A one-factorization of a regular graph G is perfect if the union of any two one-factors is a Hamilto...
AbstractThe following problem has arisen in the study of graphs, lattices and finite topologies. Is ...
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...
A 1-factorization of a graph G is a decomposition of G into edge-disjoint 1-factors (perfect matchin...
A perfect 1-factorisation of a graph G is a decomposition of G into edge disjoint 1-factors such tha...
A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cy...
AbstractA 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamilt...
AbstractA perfect 1-factorisation of a graph G is a decomposition of G into edge disjoint 1-factors ...
Abstract: A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect ma...
A 1-factorization of a graph is a decomposition of the graph into edge disjoint perfect matchings. T...
We report the results of a computer enumeration that found that there are 3155 perfect 1-factorisati...
A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists ...
Atomic latin squares have indivisible structure which mimics that of the cyclic groups of prime orde...
A 1-factorization M = {M_1,M_2,...,M_n} of a graph G is called perfect if the union of any pair of 1...
A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into...
A one-factorization of a regular graph G is perfect if the union of any two one-factors is a Hamilto...
AbstractThe following problem has arisen in the study of graphs, lattices and finite topologies. Is ...
A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set in...
A 1-factorization of a graph G is a decomposition of G into edge-disjoint 1-factors (perfect matchin...