Abstract

Let G be a connected graph on n vertices, and let α, β, γ and δ be edge-disjoint cycles in G such that (i) α, β (respectively, γ, δ) are vertex-disjoint and (ii) |Ga| + |β| = |γ| + |δ| = n,

Full Text
Paper version not known

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 call

Disclaimer: 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.