scientific article

zbMath0746.00028MaRDI QIDQ4004080

No author found.

Publication date: 18 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (51)

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

This page was built for publication: