Abstract
A graph G = ( V , E ) is called l-mixed p-connected if G - S - L is connected for all pairs S , L with S ⊆ V , L ⊆ E , and l | S | + | L | < p . This notion is a common generalisation of m-vertex-connectivity ( l = 1 , p = m ) and m-edge-connectivity ( l ⩾ m , p = m ). We show how to use maximum adjacency orderings to find sparse certificates and removable cycles in l-mixed p-connected graphs in linear time.
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.
