scientific article
From MaRDI portal
Publication:3745851
zbMath0607.05014MaRDI QIDQ3745851
Charles J. Colbourn, Alexander Rosa
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (50)
Toward the classification of Moufang loops of order 64. ⋮ The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors ⋮ Quadratic leaves of maximal partial triple systems ⋮ Decompositions of complete graphs into circulants ⋮ On the existence of unparalleled even cycle systems ⋮ On 6-sparse Steiner triple systems ⋮ Threefold triple systems with nonsingular \(N_2\) ⋮ Generalized packing designs ⋮ A possible analogue of \(\rho\)-labellings for 3-uniform hypergraphs ⋮ Optimal and pessimal orderings of Steiner triple systems in disk arrays. ⋮ Rank inequalities and separation algorithms for packing designs and sparse triple systems. ⋮ \(\operatorname{GDD}(n, 2, 4; \lambda_1, \lambda_2)\) with equal number of even and odd blocks ⋮ Links between two semisymmetric graphs on 112 vertices via association schemes ⋮ The Doyen--Wilson theorem for kite systems ⋮ On triple systems and strongly regular graphs ⋮ Embedding Steiner triple systems into Steiner systems \(S(2,4,v)\). ⋮ On \(c\)-Bhaskar Rao designs and tight embeddings for path designs ⋮ Steiner triple systems of order 19 and 21 with subsystems of order 7 ⋮ Small embeddings for partial triple systems of odd index ⋮ Grooming traffic to minimize load ⋮ Latin directed triple systems ⋮ A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs ⋮ The fine structure of threefold triple systems: \(v\equiv 1 \text{ or }3\pmod 6\) ⋮ On a class of completable partial edge-colourings ⋮ Perfect dexagon triple systems ⋮ Tight blocking sets in some maximum packings of \(\lambda K_n\) ⋮ Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19 ⋮ A lower bound for the number of orientable triangular embeddings of some complete graphs ⋮ Doyen-Wilson theorem for perfect hexagon triple systems ⋮ Decomposing triples into cyclic designs ⋮ Super-simple, pan-orientable and pan-decomposable GDDs with block size 4 ⋮ Triangulations of orientable surfaces by complete tripartite graphs ⋮ Maximum genus embeddings of Steiner triple systems ⋮ STS-graphs of perfect codes mod kernel ⋮ Group divisible designs with three unequal groups and larger first index ⋮ Minimum embedding of Steiner triple systems into \((K_4 - e)\)-designs. II ⋮ Projective, affine, and abelian colorings of cubic graphs ⋮ Minimum embedding of Steiner triple systems into \((K4-e)\)-designs. I ⋮ The spectrum for quasigroups with cyclic automorphisms and additional symmetries. ⋮ Embeddings of partial Steiner triple systems ⋮ Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs ⋮ Perfect dexagon triple systems with given subsystems ⋮ On \(b\)-coloring of the Kneser graphs ⋮ A non-existence result on cyclic cycle-decompositions of the cocktail party graph ⋮ Smallest defining sets of directed triple systems ⋮ Steiner almost self-complementary graphs and halving near-Steiner triple systems ⋮ Some equitably 3-colourable cycle decompositions of complete equipartite graphs ⋮ Coloring face-hypergraphs of graphs on surfaces ⋮ An asymptotic existence result on compressed sensing matrices ⋮ Uniquely 3-colourable Steiner triple systems
This page was built for publication:
