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

DOI10.1007/BF01787731zbMath0727.05049MaRDI QIDQ803166

N. E. Zubov

Publication date: 1990

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

zbMATH Keywords

complementpackable graphs

Mathematics Subject Classification ID

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

Related Items (4)

k-Planar Placement and Packing of Δ-Regular Caterpillars ⋮ Packing of graphs with small product of sizes ⋮ Packing of graphs - a survey ⋮ A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge

Cites Work

• Unnamed Item
• Edge disjoint placement of graphs
• Two theorems on packings of graphs
• Embedding (p,p - 1) graphs in their complements
• Packings of graphs and applications to computational complexity
• 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

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