Sparse certificates and removable cycles in l-mixed p-connected graphs

Alex R. Berg, Tibor Jordán

Research output: Contribution to journalArticle

4 Citations (Scopus)


A graph G = (V, E) is called l-mixed p-connected if G - S - L is connected for all pairs S, L with⊆ 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-conneeted graphs in linear time.

Original languageEnglish
Pages (from-to)111-114
Number of pages4
JournalOperations Research Letters
Issue number2
Publication statusPublished - Mar 1 2005



  • Connectivity of graphs
  • Ma ordering
  • Removable cycle

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this