scientific article
From MaRDI portal
Publication:4026144
zbMath0779.05032MaRDI QIDQ4026144
Brian Alspach, Katherine Heinrich, Gui Zhen Liu
Publication date: 21 February 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (33)
The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique ⋮ Orthogonal \((g,f)\)-factorizations in graphs ⋮ A Howell design admitting \(A_ 5\) ⋮ Decomposition of bipartite graphs into special subgraphs ⋮ \((g,f)\)-factorizations of graphs orthogonal to \([1,2\)-subgraphs] ⋮ Orthogonal double covers of complete graphs by trees ⋮ Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey ⋮ Generalized packing designs ⋮ Hamilton decompositions of 6-regular Cayley graphs on even abelian groups with involution-free connections sets ⋮ Hamiltonian double Latin squares ⋮ More orthogonal double covers of complete graphs by Hamiltonian paths ⋮ Orthogonal cycle systems with cycle length less than 10 ⋮ \(f\)-factors in bipartite (\(mf\))-graphs ⋮ Orthogonal double covers of \(K_{n,n}\) by small graphs. ⋮ Orthogonal double covers of general graphs. ⋮ Intersecting designs ⋮ On Hering decomposition of DK\(_n\) induced by group actions on conjugacy classes ⋮ \(k\) -factors in regular graphs ⋮ ON THE ONE EDGE ALGORITHM FOR THE ORTHOGONAL DOUBLE COVERS ⋮ Two orthogonal 4-cycle-free one-factorizations of complete graphs ⋮ Decompositions of complete multigraphs into cycles of varying lengths ⋮ Hamilton decompositions of certain 6-regular Cayley graphs on abelian groups with a cyclic subgroup of index two ⋮ Orthogonal decomposition and packing of complete graphs ⋮ On the existence of a matching orthogonal to a 2-factorization ⋮ Some problems on factorizations with constraints in bipartite graphs ⋮ Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \) ⋮ Globally simple Heffter arrays and orthogonal cyclic cycle decompositions ⋮ An existence theorem on Hamiltonian (g,f)-factors in networks ⋮ Orthogonal factorizations of digraphs ⋮ Extended Petersen graphs ⋮ Brian Alspach and his work ⋮ \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs ⋮ Vertex-transitive graphs that have no Hamilton decomposition
This page was built for publication:
