Optimal statistical designs (62K05) Statistical block designs (62K10) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40) Applications of design theory to circuits and networks (94C30) General block designs in finite geometry (51E05)
Recommendations
Cited in
(24)- Uniform hypergraphs containing no grids
- scientific article; zbMATH DE number 812039 (Why is no real title available?)
- Orthogonal decomposition and packing of complete graphs
- Packing of graphs and permutations -- a survey
- Intersecting designs
- Covering graphs: The covering problem solved
- Combinatorial and computational aspects of graph packing and graph decomposition
- An approximate version of the tree packing conjecture
- Clumsy packings of graphs
- \(H\)-packing of \(k\)-chromatic graphs
- Planar packing of trees and spider trees
- Packing copies of Cartesian product of certain classes of paths and cycles into power graphs
- Packing and decomposition of graphs with trees
- Leaves for packings with block size four
- Packing cliques in 3‐uniform hypergraphs
- The packing number of the double vertex graph of the path graph
- Graph and hypergraph packing
- Asymptotically optimal K_k-packings of dense graphs via fractional K_k-decompositions
- Problems and invariants connected with bicliques and multicliques of graphs
- Completing partial packings of bipartite graphs
- On the packing number of generalized Petersen graphs \(P(n,2)\).
- On zero-sum spanning trees and zero-sum connectivity
- Block allocation of a sequential resource
- Generalising Fisher's inequality to coverings and packings
This page was built for publication: Packing graphs: The packing problem solved
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378488)
