Decomposing 4-Regular Graphs into Triangle-Free 2-Factors

There is a polynomial algorithm which finds a decomposition of any given 4-regular graph into two triangle-free 2-factors or shows that such a decomposition does not exist.

[1]  Michael Tarsi,et al.  Graph decomposition is NPC - a complete proof of Holyer's conjecture , 1992, STOC '92.

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  Mekkia Kouider,et al.  Factorizations of 4-Regular Graphs and Petersen's Theorem , 1995, J. Comb. Theory, Ser. B.

[4]  David G. Kirkpatrick,et al.  On Restricted Two-Factors , 1988, SIAM J. Discret. Math..

[5]  W. T. Tutte.  The Factors of Graphs , 1952, Canadian Journal of Mathematics.

[6]  Gérard Cornuéjols,et al.  General factors of graphs , 1988, J. Comb. Theory, Ser. B.