Packing of graphs - a survey

DOI10.1016/0012-365X(88)90232-4zbMath0685.05036MaRDI QIDQ1825885

Hian Poh Yap

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

tree packingpacking of graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Embedding graphs of small size, Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem, A note on packing of three forests, Embedding digraphs of small size, Packing of two digraphs into a transitive tournament, Packing three trees, Labeled embedding of \((n, n-2)\)-graphs in their complements, Placing two edge-disjoint copies of a tree into a bipartite graph, Packing of graphs and permutations -- a survey, Embedding rainbow trees with applications to graph labelling and decomposition, Packing a number of copies of a \(( p , q )\)-graph, Packing three copies of a tree into a complete bipartite graph, A proof of Ringel's conjecture, Packing three copies of a tree into its sixth power, The total chromatic number of graphs having large maximum degree, Unnamed Item, Domination in certain chemical graphs, On self-complementary supergraphs of (\(n,n\))-graphs, Packing in honeycomb networks, On a graph packing conjecture by Bollobás, Eldridge and Catlin, Labeled 2-packings of trees, Domination parameters in coronene torus network, Packing trees in complete bipartite graphs, Induced packing of odd cycles in planar graphs, Packing two copies of a sparse graph into a graph with restrained maximum degree, A note on packing two copies of a tree into a graph with small maximum degree, A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge, A near packing of two graphs, Labeled packing of cycles and circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• Packing sequences
• Packing two graphs of order n having total size at most 2n-2
• Two theorems on packings of graphs
• A note on path-perfect graphs
• Embedding (p,p - 1) graphs in their complements
• Packings of graphs and applications to computational complexity
• Some remarks on packing trees
• Subgraphs of graphs. I
• Packing graphs with odd and even trees
• On maximal paths and circuits of graphs
• Packing a tree with a graph of the same size
• Embedding graphs in their complements
• Every (p,p-2) graph is contained in its complement