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