1. Berge C.: Sur le couplate maximum d’un graphe. Comptes Rendus Hebdomadaires des Séances de l’Académie Sciences [Paris] 247, 258–259 (1958)
2. Bertram E., Horak P.: Decomposing 4-regular graphs into triangle-free 2-factors. SIAM J. Discrete Math. 10, 309–317 (1997)
3. Chvátal V.: Edmonds polytopes and weakly hamiltonian graphs. Math. Prog. 5, 29–40 (1973)
4. Cook W.J., Cunningham W.H., Pulleyblank W.R., Schrijver A.: Combinatorial Optimization. Wiley, New York (1998)
5. Cornuéjols G., Naddef D., Pulleyblank W.R.: The traveling salesman problem in graphs with 3-edge cutsets. J.A.C.M. 32, 383–410 (1985)