Labeled embedding of \((n, n-2)\)-graphs in their complements

DOI10.7151/dmgt.1977zbMath1375.05221OpenAlexW2963314683MaRDI QIDQ2409792

Hamamache Kheddouci, Eric Duchêne, Mohammed Amin Tahraoui

Publication date: 13 October 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1977

zbMATH Keywords

permutationpacking of graphslabeled packing

Mathematics Subject Classification ID

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

Related Items (1)

Labeled packing of cycles and circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• Packings of graphs and applications to computational complexity
• Embedding graphs of small size
• Packing of graphs and permutations -- a survey
• Packing of graphs - a survey
• Labeled 2-packings of trees
• Every (p,p-2) graph is contained in its complement

This page was built for publication: Labeled embedding of \((n, n-2)\)-graphs in their complements