The following pages link to (Q4026144):
Displayed 33 items.
- Generalized packing designs (Q385379) (← links)
- Hamilton decompositions of 6-regular Cayley graphs on even abelian groups with involution-free connections sets (Q397160) (← links)
- Decompositions of complete multigraphs into cycles of varying lengths (Q684123) (← links)
- Hamilton decompositions of certain 6-regular Cayley graphs on abelian groups with a cyclic subgroup of index two (Q713134) (← links)
- Decomposition of bipartite graphs into special subgraphs (Q868396) (← links)
- \(k\) -factors in regular graphs (Q943560) (← links)
- Orthogonal factorizations of digraphs (Q1042545) (← links)
- On the existence of a matching orthogonal to a 2-factorization (Q1262879) (← links)
- The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique (Q1343169) (← links)
- A Howell design admitting \(A_ 5\) (Q1356445) (← links)
- \((g,f)\)-factorizations of graphs orthogonal to \([1,2]\)-subgraphs (Q1375339) (← links)
- Orthogonal double covers of complete graphs by trees (Q1376062) (← links)
- Hamiltonian double Latin squares (Q1403912) (← links)
- \(f\)-factors in bipartite (\(mf\))-graphs (Q1421483) (← links)
- Orthogonal double covers of \(K_{n,n}\) by small graphs. (Q1428552) (← links)
- Orthogonal double covers of general graphs. (Q1428558) (← links)
- Two orthogonal 4-cycle-free one-factorizations of complete graphs (Q1741579) (← links)
- Orthogonal decomposition and packing of complete graphs (Q1806215) (← links)
- Some problems on factorizations with constraints in bipartite graphs (Q1811123) (← links)
- Orthogonal \((g,f)\)-factorizations in graphs (Q1897433) (← links)
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey (Q1923505) (← links)
- Intersecting designs (Q1971015) (← links)
- On Hering decomposition of DK\(_n\) induced by group actions on conjugacy classes (Q1972358) (← links)
- Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \) (Q2305901) (← links)
- Vertex-transitive graphs that have no Hamilton decomposition (Q2349515) (← links)
- More orthogonal double covers of complete graphs by Hamiltonian paths (Q2427509) (← links)
- Extended Petersen graphs (Q2568480) (← links)
- Brian Alspach and his work (Q2568489) (← links)
- \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs (Q2581162) (← links)
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions (Q4622638) (← links)
- ON THE ONE EDGE ALGORITHM FOR THE ORTHOGONAL DOUBLE COVERS (Q5151278) (← links)
- An existence theorem on Hamiltonian (g,f)-factors in networks (Q5225333) (← links)
- Orthogonal cycle systems with cycle length less than 10 (Q6187010) (← links)