The following pages link to Darryn E. Bryant (Q186270):
Displaying 50 items.
- Decompositions of complete graphs into bipartite 2-regular subgraphs (Q281575) (← links)
- (Q413338) (redirect page) (← links)
- Decomposing the complete graph into dodecahedra (Q413339) (← links)
- (Q590448) (redirect page) (← links)
- Small embeddings for partial triple systems of odd index (Q654888) (← links)
- Paley graphs have Hamilton decompositions (Q658027) (← links)
- \(d\)-cube decompositions of \(K_n\setminus K_m\) (Q675883) (← links)
- 5-cycle systems with holes (Q677163) (← links)
- Decompositions of complete multigraphs into cycles of varying lengths (Q684123) (← links)
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions (Q707023) (← links)
- On almost-regular edge colourings of hypergraphs (Q727175) (← links)
- Edge-colored cube decompositions (Q866798) (← links)
- Packing cycles in complete graphs (Q947728) (← links)
- Packing paths in complete graphs (Q965248) (← links)
- Indivisible plexes in Latin squares (Q1009171) (← links)
- Completing partial Latin squares with two filled rows and two filled columns (Q1010774) (← links)
- The spectrum for quasigroups with cyclic automorphisms and additional symmetries. (Q1011718) (← links)
- Perpendicular rectangular Latin arrays (Q1043793) (← links)
- Complete solutions to the Oberwolfach problem for an infinite set of orders (Q1044208) (← links)
- Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete (Q1044937) (← links)
- Varieties of quasigroups arising from 2-perfect \(m\)-cycle systems (Q1200309) (← links)
- \((m,n)\)-cycle systems (Q1299002) (← links)
- The Doyen-Wilson theorem extended to 5-cycles (Q1336451) (← links)
- On the Hamilton-Waterloo problem (Q1348664) (← links)
- Strongly 2-perfect cycle systems and their quasigroups (Q1356454) (← links)
- \(i\)-perfect \(m\)-cycle systems, \(m\leq 19\) (Q1356809) (← links)
- The spectrum for lambda-fold Steiner pentagon systems (Q1361693) (← links)
- 2-perfect directed \(m\)-cycle systems can be equationally defined for \(m=3,4\), and \(5\) only (Q1361701) (← links)
- Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\) (Q1363688) (← links)
- \(2m\)-cycle systems of \(K_{2m+1}\backslash C_m\) (Q1376058) (← links)
- On the volume of 4-cycle trades (Q1396652) (← links)
- Factorizations of the complete graph into \(C_5\)-factors and 1-factors (Q1411105) (← links)
- Common multiples of complete graphs and a 4-cycle (Q1420608) (← links)
- Skolem-type difference sets for cycle systems (Q1422122) (← links)
- A generalized Markov sampler (Q1431344) (← links)
- On Alspach's conjecture with two even cycle lengths (Q1587593) (← links)
- A family of perfect factorisations of complete bipartite graphs (Q1601439) (← links)
- On the possible volumes of \(\mu\)-way Latin trades (Q1601715) (← links)
- Hamilton path decompositions of complete multipartite graphs (Q1719570) (← links)
- Generalized optimal lattice covering of finite-dimensional Euclidean space (Q1809105) (← links)
- Embeddings of partial Steiner triple systems (Q1826857) (← links)
- Mendelsohn designs associated with a class of idempotent quasigroups (Q1842156) (← links)
- \(C_4\)-saturated bipartite graphs (Q1861219) (← links)
- Some equitably 3-colourable cycle decompositions (Q1876670) (← links)
- Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves (Q1876677) (← links)
- Configurations in 4-cycle systems (Q1889824) (← links)
- A note on varieties of groupoids arising from \(m\)-cycle systems (Q1893954) (← links)
- Decomposing the complete graph into cycles of many lengths (Q1895814) (← links)
- \(2\)-perfect \(m\)-cycle systems can be equationally defined for \(m=3\), \(5\), and \(7\) only (Q1906520) (← links)
- Partitionable perfect cycle systems with cycle lengths 6 and 8 (Q1910563) (← links)
