Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
zbMATH Open0915.05023MaRDI QIDQ1277147FDOQ1277147
Authors: Ian M. Wanless 
Publication date: 2 February 1999
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119791
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (17)
- A family of perfect factorisations of complete bipartite graphs
- Loops with exponent three in all isotopes
- Row‐Hamiltonian Latin squares and Falconer varieties
- Matching graphs of hypercubes and complete bipartite graphs
- Permanents and determinants of Latin squares
- A quantitative approach to perfect one-factorizations of complete bipartite graphs
- A tripling construction for mutually orthogonal symmetric Hamiltonian double Latin squares
- Atomic Latin squares of order eleven
- Switching in one-factorisations of complete graphs
- Perfect 1-Factorizations of a Family of Cayley Graphs
- Atomic Latin squares based on cyclotomic orthomorphisms
- New families of atomic Latin squares and perfect 1-factorisations.
- Enumeration of MOLS of small order
- Matching graphs of Hypercubes and Complete Bipartite Graphs
- Title not available (Why is that?)
- Hamiltonian double Latin squares
- Cycles of quadratic Latin squares and antiperfect 1‐factorisations
This page was built for publication: Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277147)
