scientific article; zbMATH DE number 1161250

zbMath0905.05044MaRDI QIDQ4393242

Ortrud R. Oellermann

Publication date: 14 January 1999

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

zbMATH Keywords

connectivityedge-connectivityedge-disjoint pathsconnectivity pairinternally vertex-disjoint pathsconvex \(X\)-embedding

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Connectivity (05C40)

Related Items (16)

The \(k\)-subconnectedness of planar graphs ⋮ Graphs with large generalized (edge-)connectivity ⋮ Edge fault tolerance of graphs with respect to super edge connectivity ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Game connectivity of graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ On the (co)girth of a connected matroid ⋮ Tree connectivities of Cayley graphs on abelian groups with small degrees ⋮ Characterization of graphs with infinite cyclic edge connectivity ⋮ Vulnerability of super extra edge-connected graphs ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs ⋮ Characterization of \(k\)-subconnected graphs ⋮ Mixed connectivity properties of random graphs and some special graphs ⋮ Realizability of fault-tolerant graphs

This page was built for publication: