Pages that link to "Item:Q426279"
From MaRDI portal
The following pages link to Ordering block designs. Gray codes, universal cycles and configuration orderings (Q426279):
Displaying 15 items.
- Twofold triple systems without 2-intersecting Gray codes (Q521863) (← links)
- Hamilton cycles in restricted block-intersection graphs (Q648070) (← links)
- Universal and near-universal cycles of set partitions (Q907241) (← links)
- Graph universal cycles of combinatorial objects (Q2020052) (← links)
- Egalitarian edge orderings of complete graphs (Q2042215) (← links)
- \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\) (Q2175776) (← links)
- Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs (Q2223450) (← links)
- Egalitarian Steiner triple systems for data popularity (Q2232127) (← links)
- Quasi-Eulerian hypergraphs (Q2401411) (← links)
- Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs (Q2630707) (← links)
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences (Q3117226) (← links)
- ON THE EMBEDDING OF GROUPS AND DESIGNS IN A DIFFERENCE BLOCK DESIGN (Q5012156) (← links)
- Triple Systems are Eulerian (Q5346576) (← links)
- Covering hypergraphs are Eulerian (Q6081586) (← links)
- Short k‐radius sequences, k‐difference sequences and universal cycles (Q6187437) (← links)