Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree (Q1331972)

Let \(G_ n\) be an infinite eulerian graph (i.e., graph whose vertices are of even or infinite degree) that has exactly \(n\) vertices of infinite degree, and only finitely many finite components after the removal of the vertices of infinite degree. Is it possible to decompose \(G_ n\) into edge disjoint (finite or infinite) circuits and rays (one-way infinite paths)? As shown by Sabidussi, the answer is positive if \(n \leq 2\). On the other hand, Thomassen gave an example showing that such a decomposition does not exist if \(n>4\). In the paper it is proved that the answer is affirmative if \(n=3\).