scientific article
From MaRDI portal
Publication:4026144
zbMATH Open0779.05032MaRDI QIDQ4026144FDOQ4026144
Brian Alspach, Katherine Heinrich, Guizhen Liu
Publication date: 21 February 1993
Title of this publication is not available (Why is that?)
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)
Cited In (41)
- Extended Petersen graphs
- Orthogonal decomposition and packing of complete graphs
- Intersecting designs
- Brian Alspach and his work
- Hamilton decompositions of 6-regular Cayley graphs on even abelian groups with involution-free connections sets
- Decompositions of complete multigraphs into cycles of varying lengths
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
- Hamilton decompositions of certain 6-regular Cayley graphs on abelian groups with a cyclic subgroup of index two
- A Howell design admitting \(A_ 5\)
- \(k\) -factors in regular graphs
- A survey of Heffter arrays
- Vertex-transitive graphs that have no Hamilton decomposition
- Orthogonal double covers of complete graphs by trees
- \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs
- Orthogonal double covers of general graphs.
- The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
- Combinatorially orthogonal matrices and related graphs
- On the existence of a matching orthogonal to a 2-factorization
- Orthogonal factorizations of digraphs
- Decomposition of bipartite graphs into special subgraphs
- Generalized packing designs
- Orthogonal one-factorizations of complete multipartite graphs
- ON THE ONE EDGE ALGORITHM FOR THE ORTHOGONAL DOUBLE COVERS
- Orthogonal cycle systems with cycle length less than 10
- Orthogonal structures in directed graphs
- Orthogonal \((g,f)\)-factorizations in graphs
- Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
- Two orthogonal 4-cycle-free one-factorizations of complete graphs
- Orthogonal double covers of \(K_{n,n}\) by small graphs.
- Orthogonal one-factorization graphs
- Some problems on factorizations with constraints in bipartite graphs
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- Remarks on orthogonal factorizations of digraphs
- On Hering decomposition of DK\(_n\) induced by group actions on conjugacy classes
- Distinguishing orthogonality graphs
- Title not available (Why is that?)
- \((g,f)\)-factorizations of graphs orthogonal to \([1,2]\)-subgraphs
- Hamiltonian double Latin squares
- More orthogonal double covers of complete graphs by Hamiltonian paths
- \(f\)-factors in bipartite (\(mf\))-graphs
- An existence theorem on Hamiltonian (g,f)-factors in networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4026144)
