scientific article; zbMATH DE number 878899
From MaRDI portal
Publication:4878669
Recommendations
Cited in
(31)- Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
- On the -connectivity of a graph
- Triads and triangles in 3-connected matroids
- The vertex connectivity of a \(\{ 0,2\}\)-graph equals its degree
- Strongly unichord-free graphs
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems
- On minimally 2-T-connected directed graphs
- A generalization of a theorem of Diderrich in additive group theory to vertex-transitive graphs
- On minimally \((n,\lambda)\)-connected graphs
- Elements belonging to triads in 3-connected matroids
- On vertices of degree \(k\) of minimal and contraction critical \(k\)-connected graphs: upper bounds
- Large contractible subgraphs of a 3-connected graph
- Computing vertex-disjoint paths in large graphs using MAOs
- On extremal \(k\)-outconnected graphs
- High connectivity keeping sets in graphs and digraphs
- The tree of cuts and minimal \(k\)-connected graphs
- Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
- Ends and vertices of small degree in infinite minimally k-(Edge)-connected graphs
- Minimization Problems for Infinite n-Connected Graphs
- On Vertices of outdegree n in minimally n‐connected digraphs
- Tight bounds for the vertices of degree k in minimally k‐connected graphs
- On Vertices of Degree n in Minimally n-Edge-Connected Graphs
- A cut tree representation for pendant pairs
- On the minimum degree and the proper connection number of graphs
- Sparse highly connected spanning subgraphs in dense directed graphs
- Some results on the degree of a vertex of a graph with respect to any vertexset
- Generalized cut trees for edge-connectivity
- On vertices of outdegree k in minimally k-arc-connected digraphs
- Restriction on minimum degree in the contractible sets problem
- Minimal biconnected graphs
- On minimally \(k\)-connected matroids
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4878669)
