×

A new sufficient condition for \(S\)-circuits in graphs. (English) Zbl 0742.05054

Summary: P. Paulraja posed the following problem: Let \(G\) be a 2-connected graph such that \(\delta(G)\geq 3\), where \(\delta(G)\) denotes the minimum degree of \(G\). If each edge of \(G\) lies on either a cycle of length 3 or a cycle of length 4, is it true that \(G\) has a spanning Eulerian subgraph? A related case in which \(\delta(G)\geq 4\) is settled affirmatively in this paper.

MSC:

05C38 Paths and cycles
PDFBibTeX XMLCite