scientific article; zbMATH DE number 878899

zbMath0849.05048MaRDI QIDQ4878669

W. Mader

Publication date: 3 November 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(n\)-connected graphs\(n\)-connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (16)

Elements belonging to triads in 3-connected matroids ⋮ The tree of cuts and minimal \(k\)-connected graphs ⋮ Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\) ⋮ On extremal \(k\)-outconnected graphs ⋮ Generalized cut trees for edge-connectivity ⋮ Minimal biconnected graphs ⋮ Large contractible subgraphs of a 3-connected graph ⋮ Strongly unichord-free graphs ⋮ On minimally \(k\)-connected matroids ⋮ Unnamed Item ⋮ Computing vertex-disjoint paths in large graphs using MAOs ⋮ Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems ⋮ Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs ⋮ Triads and triangles in 3-connected matroids ⋮ High connectivity keeping sets in graphs and digraphs ⋮ On minimally \((n,\lambda)\)-connected graphs

This page was built for publication: