Decomposing complete graphs into isomorphic complete multipartite graphs
From MaRDI portal
Cites work
- A new class of optimal 3-splitting authentication codes
- A survey on the existence ofG-Designs
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- Construction and nonexistence of strong external difference families
- Constructions of external difference families and disjoint difference families
- Constructions of optimal difference systems of sets
- Cyclotomic construction of strong external difference families in finite fields
- Cyclotomic constructions of external difference families and disjoint difference families
- Cyclotomy and difference families in elementary Abelian groups
- Decomposition of complete graphs into isomorphic complete bipartite graphs
- Decomposition of complete graphs into stars
- Decomposition of complete multigraphs into stars
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Difference systems of sets and code synchronization
- Difference systems of sets and cyclotomy
- Existence and non-existence results for strong external difference families
- Existence on splitting-balanced block designs with resolvability
- External Difference Families from Finite Fields
- Further results on the existence of splitting BIBDs and application to authentication codes
- High-Rate Self-Synchronizing Codes
- scientific article; zbMATH DE number 3710227 (Why is no real title available?)
- scientific article; zbMATH DE number 3478748 (Why is no real title available?)
- scientific article; zbMATH DE number 2147946 (Why is no real title available?)
- scientific article; zbMATH DE number 3428942 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- scientific article; zbMATH DE number 3395950 (Why is no real title available?)
- Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs
- Internal and external partial difference families and cyclotomy
- Near-complete external difference families
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- New existence and nonexistence results for strong external difference families
- On claw-decomposition of complete graphs and complete bigraphs
- On disjoint \((v,k,k-1)\) difference families
- On the existence of balanced bipartite designs. II
- Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs
- Optimal difference systems of sets and partition-type cyclic difference packings
- Partitions and other coverings of finite groups.
- Perfect difference systems of sets and Jacobi sums
- Some results on generalized strong external difference families
- Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes
- Splitting balanced incomplete block designs with block size 3 × 2
- Strong external difference families in abelian and non-abelian groups
- The Coarseness of the Complete Graph
- The CRC handbook of combinatorial designs
- Weighted external difference families and R-optimal AMD codes
Cited in
(1)
This page was built for publication: Decomposing complete graphs into isomorphic complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613355)
