A family of perfect factorisations of complete bipartite graphs
A 1-factorization of a graph is called perfect if the union of any two of its 1-factors is a single (Hamiltonian) cycle. A Latin square is pan-Hamiltonian if the permutation determined by any pair of rows yields a single cycle. Let \(p\) be any odd prime and let \(n= p^2\). The authors construct \((p-1)/2\) non-isotopic pan-Hamiltonian Latin squares of order \(n\). Equivalently, this yields a family of \((p-1)/2\) non-isomorphic perfect 1-factorizations of the complete bipartite graph \(K_{n,n}\), thereby establishing existence for infinitly many new values of \(n\).
- Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
- New families of atomic Latin squares and perfect 1-factorisations.
- On perfect one-factorization of the complete graph \(K_{2p}\)
- A quantitative approach to perfect one-factorizations of complete bipartite graphs
- scientific article; zbMATH DE number 4043852
- Hamiltonian-connected self-complementary graphs
- scientific article; zbMATH DE number 3733976 (Why is no real title available?)
- scientific article; zbMATH DE number 16256 (Why is no real title available?)
- scientific article; zbMATH DE number 3621774 (Why is no real title available?)
- scientific article; zbMATH DE number 979131 (Why is no real title available?)
- scientific article; zbMATH DE number 1153454 (Why is no real title available?)
- scientific article; zbMATH DE number 4118385 (Why is no real title available?)
- scientific article; zbMATH DE number 3801586 (Why is no real title available?)
- scientific article; zbMATH DE number 812037 (Why is no real title available?)
- On maximal circuits in directed graphs
- Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
- PROPER LOOPS OF ORDER η IN WHICH EACH NON-IDENTITY ELEMENT HAS LEFT ORDER η
- A note on acyclic edge coloring of complete bipartite graphs
- Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
- Hamiltonian double Latin squares
- Semi-perfect 1-factorizations of the hypercube
- A quantitative approach to perfect one-factorizations of complete bipartite graphs
- New families of atomic Latin squares and perfect 1-factorisations.
- Atomic Latin squares based on cyclotomic orthomorphisms
- Family sizes for complete multipartite graphs
- Cycle codes of graphs and MDS array codes
- On the perfect 1-factorisation problem for circulant graphs of degree 4
- Perfect 1-Factorizations of a Family of Cayley Graphs
- scientific article; zbMATH DE number 4043852 (Why is no real title available?)
- scientific article; zbMATH DE number 4049662 (Why is no real title available?)
- scientific article; zbMATH DE number 1555974 (Why is no real title available?)
- scientific article; zbMATH DE number 4118385 (Why is no real title available?)
- On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)
- d‐Regular graphs of acyclic chromatic index at least d+2
- scientific article; zbMATH DE number 6470737 (Why is no real title available?)
- Cycles of quadratic Latin squares and antiperfect 1‐factorisations
- Row‐Hamiltonian Latin squares and Falconer varieties
- On acyclic edge-coloring of complete bipartite graphs
- Perfect 1-factorisations of \(K_{11,11}\)
- On perfect one-factorization of the complete graph \(K_{2p}\)
This page was built for publication: A family of perfect factorisations of complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601439)
