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

DOI10.7151/DMGT.1977zbMATH Open1375.05221OpenAlexW2963314683MaRDI QIDQ2409792FDOQ2409792

Authors: H. Kheddouci, M. A. Tahraoui, E. Duchêne 

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

Recommendations

• Labeled 2-packings of trees
• Labeled packings of graphs
• Labeled packing of cycles and circuits
• Packing two graphs of order n having total size at most 2n-2
• Two theorems on packings of graphs

zbMATH Keywords

permutationpacking of graphslabeled packing

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Labeled packings of graphs
• Labeled packing of non star trees into their \(k\) th power, \(k\geq 5\)
• On the number of 2-packings in a connected graph
• Labeled 2-packings of trees
• Labeled packing of cycles and circuits

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

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