Abstract
AbstractLet G be a finite k‐edge‐connected simple graph. We consider when a set of independent edges can be extended to a 2‐factor such that this 2‐factor avoids a fixed set of independent edges. A complete characterization is provided in those cases, where this is feasible. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 48–58, 2005
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.
