Packing two graphs of order n having total size at most 2n-2

DOI10.1007/BF01787731zbMATH Open0727.05049MaRDI QIDQ803166FDOQ803166

Authors: N. E. Zubov 

Publication date: 1990

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• Two theorems on packings of graphs
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• On a packing problem of Alon and Yuster
• scientific article; zbMATH DE number 1022391
• A near packing of two graphs

zbMATH Keywords

complementpackable graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Packings of graphs and applications to computational complexity
• Packing a tree with a graph of the same size
• Edge disjoint placement of graphs
• Title not available (Why is that?)
• Every (p,p-2) graph is contained in its complement
• Embedding (p,p - 1) graphs in their complements
• Embedding graphs in their complements
• Two theorems on packings of graphs

Cited In (12)

• Packing of graphs with small product of sizes
• Three edge-disjoint plane spanning paths in a point set
• Packing a tree of order \(p\) with a \((p,p+1)\)-graph
• A hypergraph version of a graph packing theorem by Bollobás and Eldridge
• Note on compact packing of a graph
• A note on uniquely embeddable graphs
• Packing graphs in their complements
• On packable digraphs
• k-Planar Placement and Packing of Δ-Regular Caterpillars
• Packing of graphs - a survey
• Packing two graphs of even girth 10
• Two theorems on packings of graphs

This page was built for publication: Packing two graphs of order n having total size at most 2n-2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803166)