Abstract
Purchase PDF (164 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (2)
doi:10.1016/j.orl.2004.05.008 
Copyright © 2004 Elsevier B.V. All rights reserved.
Received 13 February 2004;
accepted 31 May 2004.
Available online 8 September 2004.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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, LE, 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.
Keywords: Connectivity of graphs; MA ordering; Removable cycle
