scientific article
From MaRDI portal
Publication:3728911
zbMath0597.05010MaRDI QIDQ3728911
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitysurvey paperdesignsblock designsisomorphism invariantsresolvable designsisomorphism testingintersection problemsorientingalgorithmic techniquescoloring elementscompleting designsdirecting designsembedding designs
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Discrete mathematics in relation to computer science (68R99)
Related Items
Isomorphism and Invariants of Parallelisms of Projective Spaces ⋮ A construction of cyclic Steiner triple systems of order \(p^ n\) ⋮ The strong chromatic number of partial triple systems ⋮ Finding regular subgraphs in both arbitrary and planar graphs ⋮ Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ On the Bays-Lambossy theorem ⋮ A parallelization of Miller's \(n^{\log n}\) isomorphism technique ⋮ Existence results for doubly near resolvable \((v,3,2)\)-BIBDs ⋮ A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares ⋮ The 1-rotational Kirkman triple systems of order 33
This page was built for publication:
