Two theorems on packings of graphs

DOI10.1016/S0195-6698(87)80011-2zbMath0621.05025OpenAlexW2027316216MaRDI QIDQ1090341

B. George

Publication date: 1987

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(87)80011-2

zbMATH Keywords

packable graphs

Mathematics Subject Classification ID

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

Related Items (3)

On packing bipartite graphs ⋮ Packing of graphs - a survey ⋮ Packing two graphs of order n having total size at most 2n-2

Cites Work

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

This page was built for publication: Two theorems on packings of graphs