On uniqueness of packing of three copies of 2-factors

DOI10.7494/opmath.2025.45.1.79MaRDI QIDQ6667292

Tomáš Madaras, Unnamed Author, Alfréd Onderko

Publication date: 20 January 2025

Published in: Opuscula Mathematica (Search for Journal in Brave)

zbMATH Keywords

2-factor3-packinguniquely packable graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• On Hamilton cycle decomposition of 6-regular circulant graphs
• Packing three copies of a tree into a complete graph
• Embedding (p,p - 1) graphs in their complements
• Packings of graphs and applications to computational complexity
• On planarity and colorability of circulant graphs
• Packing of graphs and permutations -- a survey
• Packing of graphs - a survey
• Triple placement of graphs
• A note on uniquely embeddable forests
• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• Every (p,p-2) graph is contained in its complement
• A note on uniquely embeddable graphs
• Embedding Arbitrary Graphs of Maximum Degree Two
• A note on uniquely embeddable 2-factors

This page was built for publication: On uniqueness of packing of three copies of 2-factors