Abstract
We characterize the graphs that admit a decomposition into circuits, i.e. finite or infinite connected 2-regular graphs. Moreover, we show that, as is the case for the removal of a closed eulerian subgraph from a finite graph, removal of a non-dominated eulerian subgraph from a (finite or infinite) graph does not change its circuit-decomposability or circuit-indecomposability. For cycle-decomposable graphs, we show that in any end which contains at least n + 1 pairwise edge-disjoint rays, there are n edge-disjoint rays that can be removed from the graph without altering its cycle-decomposability. We also generalize the notion of the parity of the degree of a vertex to vertices of infinite degree, and in this way extend the well-known result that eulerian finite graphs are circuit-decomposable to graphs of arbitrary cardinality.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
