A note on uniquely embeddable 2-factors

DOI10.1016/J.AMC.2023.128505arXiv2304.12915OpenAlexW4390122839MaRDI QIDQ6131572FDOQ6131572

Authors: Monika Pilśniak, Mariusz Woźniak 

Publication date: 18 April 2024

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Abstract: Let $C_{n_1}cup{C}_{n_2}cupldotscup{C}_{n_k}$ be a 2-factor i.e. a vertex-disjoint union of cycles. In this note we completely characterize those 2-factors that are uniquely embeddeble in their complement.

Full work available at URL: https://arxiv.org/abs/2304.12915

Recommendations

• A note on uniquely embeddable graphs
• A note concerning graphs with unique f-factors
• On the structure of graphs having a unique \(k\)-factor
• A note on uniquely embeddable forests
• Intersections of cycling 2-factors

Mathematics Subject Classification ID

Graph theory (05Cxx) Designs and configurations (05Bxx) Combinatorics (05-XX)

Cited In (1)

• On uniqueness of packing of three copies of 2-factors

This page was built for publication: A note on uniquely embeddable 2-factors

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