When m vertices in a k-connected graph cannot be walked round along a simple cycle.

Alexander K. Kelmans M. V. Lomonosov

Published in: Discret. Math. (1982)

Keyphrases

weighted graph
connected components
hamiltonian cycle
graph representation
data sets
query graph
attributed graphs
adjacency matrix
maximum matching
labeled graphs
vertex set
minimum weight
graph partitioning
bipartite graph
directed graph
random walk
clustering algorithm
learning algorithm