Labeled packing of cycles and circuits

DOI10.7151/dmgt.2290zbMath1485.05148OpenAlexW2998932712WikidataQ126348535 ScholiaQ126348535MaRDI QIDQ2118238

Hamamache Kheddouci, Alice Joffard

Publication date: 22 March 2022

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

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

zbMATH Keywords

cyclescircuitspacking of graphslabeled packing

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• Packings of graphs and applications to computational complexity
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• Packing of graphs and permutations -- a survey
• Packing of graphs - a survey
• Packing two copies of a tree into its fourth power
• Labeled embedding of \((n, n-2)\)-graphs in their complements
• Packing two copies of a tree into its third power
• Labeled 2-packings of trees
• On the packing of three graphs

This page was built for publication: Labeled packing of cycles and circuits