Tree-designs with balanced-type conditions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3650602 (Why is no real title available?)
- scientific article; zbMATH DE number 3710227 (Why is no real title available?)
- scientific article; zbMATH DE number 3517174 (Why is no real title available?)
- scientific article; zbMATH DE number 3542447 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- scientific article; zbMATH DE number 3428942 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- A survey on the existence ofG-Designs
- Balanced and strongly balanced \(P_k\)-designs
- Decomposition of complete graphs into stars
- Degree- and orbit-balanced -designs when has five vertices
- Graph decompositions, handcuffed prisoners and balanced p-designs
- Graph theory with applications
- Handcuffed designs
- On the existence of balanced bipartite designs. II
- Opening the door
- The CRC handbook of combinatorial designs
Cited in
(6)- Balanced House-systems and nestings.
- Edge balanced star‐hypergraph designs and vertex colorings of path designs
- Survey on balanced graph and hypergraph designs
- Degree- and orbit-balanced -designs when has five vertices
- Balanced and strongly balanced 4-kite designs
- Balance, partial balance and balanced-type spectra in graph-designs
This page was built for publication: Tree-designs with balanced-type conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385383)