On ‐connected graphs
From MaRDI portal
Publication:5229537
Abstract: A graph G is called (2k, k)-connected if G is 2k-edge-connected and G-v is k-edge-connected for every vertex v. The study of (2k, k)-connected graphs is motivated by a conjecture of Frank which states that a graph has a 2-vertex-connected orientation if and only if it is (4, 2)-connected. In this paper, we provide a construction of the family of (2k, k)-connected graphs for k even which generalizes the construction given by Jord'an for k = 2. We also solve the corresponding connectivity augmentation problem: given a graph G and an integer k geq 2, what is the minimum number of edges to be added to make G (2k, k)-connected. Both these results are based on a new splitting-off theorem for (2k, k)-connected graphs.
Recommendations
- On \(k\)-critical \(2 k\)- connected graphs
- scientific article; zbMATH DE number 3916310
- scientific article; zbMATH DE number 1960407
- On Graphs with Proper Connection Number 2
- On the structure of a \(k\)-connected graph
- On perfectly two-edge connected graphs
- On connected 2-\(K_n\)-residual graphs
- On \(k\)-connected-homogeneous graphs
- On \(k\)-chromatically connected graphs
- scientific article; zbMATH DE number 867625
Cited in
(11)- Globally rigid augmentation of rigid graphs
- Two paths joining given vertices in \(2k\)-edge-connected graphs
- Note on the vertex 2–connectivity of a graph
- On the Euler genus of a 2-connected graph
- On \(k\)-critical \(2 k\)- connected graphs
- 2-connected and 2-edge-connected Steinhaus graphs
- On perfectly two-edge connected graphs
- On \(k\)-connected-homogeneous graphs
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
- The complexity of 2-vertex-connected orientation in mixed graphs
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
This page was built for publication: On ‐connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5229537)
