scientific article - MaRDI portal

zbMATH Open0746.00028MaRDI QIDQ4004080FDOQ4004080

Author name not available (Why is that?)

Publication date: 18 September 1992

Title of this publication is not available (Why is that?)

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06)

Cited In (54)

Embedding path designs into kite systems
Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
On the existence of partitionable skew Room frames
The advice complexity of a class of hard online problems
Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
A universal bound for a covering in regular posets and its application to pool testing
On \(J_{m}\)-Hadamard matrices
2-designs and redundant syndrome extraction for quantum error correction
The existence of subdigraphs with orthogonal factorizations in digraphs
Discussions on orthogonal factorizations in digraphs
Subdigraphs with orthogonal factorizations of digraphs
Subgraphs with orthogonal factorizations in graphs
Difference sets with \(n=2p^m\)
Nonexistence of abelian difference sets: Lander’s conjecture for prime power orders
Subgraphs with orthogonal factorizations and algorithms
Linearly many rainbow trees in properly edge-coloured complete graphs
Edge-disjoint rainbow trees in properly coloured complete graphs
Cyclic self-dual \(\mathbb Z_4\)-codes.
Title not available (Why is that?)
Phase retrieval from Gabor measurements
\((g,f)\)-factorizations orthogonal to a subgraph of a graph
A construction for infinite families of Steiner 3-designs
Candelabra systems and designs
Authentication codes in plaintext and chosen-content attacks
Existence of subgraphs with orthogonal \((g,f)\)-factorization
A result on \(r\)-orthogonal factorizations in digraphs
Embedding rainbow trees with applications to graph labelling and decomposition
Randomly orthogonal factorizations with constraints in bipartite networks
On large sets of hybrid triple systems
Application of cover-free codes and combinatorial designs to two-stage testing.
Title not available (Why is that?)
The existence theorem for group divisible designs of large order
The use of hill‐climbing to construct orthogonal steiner triple systems
Ordinary graphs and subplane partitions
A class of self-orthogonal 2-sequencings
A formula for the number of Steiner quadruple systems on 2ⁿ points of 2‐rank 2ⁿ−n
Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
Combinatorial problems motivated by comma‐free codes
Randomly orthogonal factorizations in networks
Subdigraphs with orthogonal factorizations of digraphs. II
Oriented Steiner quasigroups.
Strong Skolem starters
Room square patterns
On the construction of balanced Room squares
A generalization of orthogonal factorizations in digraphs
Mixed covering arrays of strength three with few factors
Randomly \(r\)-orthogonal factorizations in bipartite graphs
A survey on modular Hadamard matrices
4-blocked Hadamard 3-designs
Optimal difference systems of sets and partition-type cyclic difference packings
Preface: CALDAM 2017
On products of strong Skolem starters
Cyclic cycle systems of the complete multipartite graph
A recursive construction of doubly resolvable Steiner quadruple systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4004080)