Graphs with every k-matching in a Hamiltonian cycle. - Grzegorz Gancarzewicz; A. Pawel Wojda (Discret. Math., 2000)

Hamiltonian cycles and paths through matchings. - Denise Amar; Evelyne Flandrin; Grzegorz Gancarzewicz (Electron. Notes Discret. Math., 2005)

Bipartite graphs with every matching in a cycle. - Denise Amar; Evelyne Flandrin; Grzegorz Gancarzewicz; A. Pawel Wojda (Discret. Math., 2007)

A degree condition implying that every matching is contained in a hamiltonian cycle. - Denise Amar; Evelyne Flandrin; Grzegorz Gancarzewicz (Discret. Math., 2009)