Abstract
For a graph G , let ν ( G ) and ν ′ ( G ) denote the maximum cardinalities of packings of vertex-disjoint and edge-disjoint cycles of G , respectively. We study the interplay of these two parameters and vertex cuts in graphs. If G is a graph whose vertex set can be partitioned into three non-empty sets S , V 1 , and V 2 such that there is no edge between V 1 and V 2 , and k = | S | , then our results imply that ν ( G ) is uniquely determined by the values ν ( H ) for at most 2 k + 1 k ! 2 graphs H of order at most max { | V 1 | , | V 2 | } + k , and ν ′ ( G ) is uniquely determined by the values ν ′ ( H ) for at most 2 k 2 + 1 graphs H of order at most max { | V 1 | , | V 2 | } + k .
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.
