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

DOI10.7151/DMGT.1977MaRDI QIDQ2409792zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

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

Cites work

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

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)