On \(k\)-con-critically \(n\)-connected graphs

DOI10.1006/jctb.2002.2129zbMath1024.05052OpenAlexW2006070432MaRDI QIDQ1403923

W. Mader

Publication date: 20 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2002.2129

zbMATH Keywords

critical connectivityvulnerability of networks

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (6)

There exist highly critically connected graphs of diameter three ⋮ Connectivity keeping edges in graphs with large minimum degree ⋮ Extremal infinite graph theory ⋮ Power assignment for \(k\)-connectivity in wireless ad hoc networks ⋮ A connected subgraph maintaining high connectivity ⋮ High connectivity keeping sets in graphs and digraphs

Cites Work

• High connectivity keeping sets in \(n\)-connected graphs
• Endlichkeitssätze für k-kritische Graphen
• Contractible triples in 3-connected graphs
• Contractible subgraphs in 3-connected graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(k\)-con-critically \(n\)-connected graphs