Packing graphs: The packing problem solved
From MaRDI portal
Publication:1378488
zbMath0885.05052MaRDI QIDQ1378488
Publication date: 12 February 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119247
Optimal statistical designs (62K05) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Statistical block designs (62K10) Applications of design theory to circuits and networks (94C30) Combinatorial aspects of packing and covering (05B40) General block designs in finite geometry (51E05)
Related Items (16)
An approximate version of the tree packing conjecture ⋮ Unnamed Item ⋮ Leaves for packings with block size four ⋮ Uniform hypergraphs containing no grids ⋮ Packing cliques in 3‐uniform hypergraphs ⋮ Packing of graphs and permutations -- a survey ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Intersecting designs ⋮ Generalising Fisher's inequality to coverings and packings ⋮ Clumsy packings of graphs ⋮ Planar packing of trees and spider trees ⋮ Orthogonal decomposition and packing of complete graphs ⋮ Covering graphs: The covering problem solved ⋮ Packing and decomposition of graphs with trees ⋮ On zero-sum spanning trees and zero-sum connectivity ⋮ Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
This page was built for publication: Packing graphs: The packing problem solved
