K-vertex-connected graph

Known as: K-connected graph, Vertex connectivity 
In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
A growing body of work addresses the challenge of processing dynamic graph streams: a graph is defined by a sequence of edge… (More)
Is this relevant?
2010
2010
We present an algorithm for testing the k-vertex-connectivity of graphs with the given maximum degree. The time complexity of the… (More)
  • table 1
  • figure 1
Is this relevant?
2010
2010
Given a k-connected graph G = (V ,E) and V ′ ⊂ V , k-Vertex-Connected Subgraph Augmentation Problem (k-VCSAP) is to find S ⊂ V… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The goal of graph clustering is to partition vertices in a large graph into different clusters based on various criteria such as… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2002
2002
(MATH) We present two new algorithms for the problem of finding a minimum-cost k-vertex connected spanning subgraph. The first… (More)
Is this relevant?
1999
1999
  • Eric Babson, Anders Bjorner, Svante Linusson, John Shareshian, Volkmar Welker
  • 1999
Complexes of (not) connected graphs, hypergraphs and their homology appear in the construction of knot invariants given by V… (More)
  • table 1
  • table 3
  • table 4
  • table 5
  • table 6
Is this relevant?
1994
1994
We study the k-diameter of k-regular k-connected graphs. Among other results, we show that every k-regular k-connected graph on n… (More)
  • figure 1
  • figure 2
Is this relevant?
1991
1991
A certificate for the k-vertex connectivity of a graph G = (V, E) is a subset E’ of E such that (V, E’) is k-vertex connected iff… (More)
  • figure 1
  • figure 2
Is this relevant?
1981
1981
We show that every k-connected graph with no 3-cycle contains an edge whose contraction results in a k-connected graph and use… (More)
Is this relevant?