Ordering block designs. Gray codes, universal cycles and configuration orderings
From MaRDI portal
Publication:426279
DOI10.1007/978-1-4614-4325-4zbMath1260.05001OpenAlexW2504432296WikidataQ55951107 ScholiaQ55951107MaRDI QIDQ426279
Publication date: 11 June 2012
Published in: CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-4325-4
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs ⋮ Quasi-Eulerian hypergraphs ⋮ \(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\) ⋮ Triple Systems are Eulerian ⋮ Covering hypergraphs are Eulerian ⋮ Short k‐radius sequences, k‐difference sequences and universal cycles ⋮ Universal and near-universal cycles of set partitions ⋮ Hamilton cycles in restricted block-intersection graphs ⋮ Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs ⋮ Egalitarian Steiner triple systems for data popularity ⋮ Twofold triple systems without 2-intersecting Gray codes ⋮ Graph universal cycles of combinatorial objects ⋮ Egalitarian edge orderings of complete graphs ⋮ Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences ⋮ ON THE EMBEDDING OF GROUPS AND DESIGNS IN A DIFFERENCE BLOCK DESIGN
This page was built for publication: Ordering block designs. Gray codes, universal cycles and configuration orderings
