Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
From MaRDI portal
Publication:1277147
zbMath0915.05023MaRDI QIDQ1277147
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
Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Perfect 1-Factorizations of a Family of Cayley Graphs ⋮ Loops with exponent three in all isotopes ⋮ Cycles of quadratic Latin squares and antiperfect 1‐factorisations ⋮ Switching in one-factorisations of complete graphs ⋮ Matching graphs of Hypercubes and Complete Bipartite Graphs ⋮ Row‐Hamiltonian Latin squares and Falconer varieties ⋮ Hamiltonian double Latin squares ⋮ A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares ⋮ New families of atomic Latin squares and perfect 1-factorisations. ⋮ Enumeration of MOLS of small order ⋮ Permanents and Determinants of Latin Squares ⋮ Matching graphs of hypercubes and complete bipartite graphs ⋮ A quantitative approach to perfect one-factorizations of complete bipartite graphs ⋮ A family of perfect factorisations of complete bipartite graphs
