Packing graphs: The packing problem solved

zbMATH Open0885.05052MaRDI QIDQ1378488FDOQ1378488

Authors: Yair Caro, Raphael Yuster 

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 1229732
• Integer and fractional packings in dense graphs
• On a packing problem of Alon and Yuster
• Solution of two problems of P. Erdős concerning Hamiltonian cycles

zbMATH Keywords

decompositionpacking problem

Mathematics Subject Classification ID

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)

Cited In (24)

• Uniform hypergraphs containing no grids
• Orthogonal decomposition and packing of complete graphs
• Intersecting designs
• Packing of graphs and permutations -- a survey
• 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
• Leaves for packings with block size four
• Packing and decomposition of graphs with trees
• Packing cliques in 3‐uniform hypergraphs
• Graph and hypergraph packing
• The packing number of the double vertex graph of the path graph
• Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
• Problems and invariants connected with bicliques and multicliques of graphs
• On the packing number of generalized Petersen graphs \(P(n,2)\).
• Completing partial packings of bipartite graphs
• On zero-sum spanning trees and zero-sum connectivity
• Block allocation of a sequential resource
• Generalising Fisher's inequality to coverings and packings
• Title not available (Why is that?)

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)