Year-end Sale % OFF 
Abstract
An edge of a k -connected graph is said to be k -removable (resp. k -contractible) if the removal (resp. the contraction ) of the edge results in a k -connected graph. A k -connected graph with neither k -removable edge nor k -contractible edge is said to be minimally contraction-critically k -connected. We show that around an edge whose both end vertices have degree greater than 5 of a minimally contraction-critically 5-connected graph, there exists one of two specified configurations. Using this fact, we prove that each minimally contraction-critically 5-connected graph on n vertices has at least 2 3 n vertices of degree 5.
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.
