Packing graphs in their complements

DOI10.1016/S0012-365X(97)00186-6zbMath0958.05111MaRDI QIDQ1584285

T. Gangopadhyay

Publication date: 2 November 2000

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

zbMATH Keywords

self-packing graphs

Mathematics Subject Classification ID

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

Related Items (1)

Packing of graphs and permutations -- a survey

Cites Work

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

This page was built for publication: Packing graphs in their complements