The problem of determining whether a graph has a Hamilton cycle is NP-complete whereas there exists a polynomial algorithm to determine whether a graph has a perfect 2-matching.
These two problems are related to the question of determining whether a graph has a perfect triangle-free 2-matching. We give a polynomial algorithm to answer this question and to find a perfect triangle-free 2-matching if one exists.