Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph.

Matthias Kriesell

Published in: Graphs Comb. (2002)

Keyphrases

upper bound
connected graphs
random graphs
lower bound
small number
undirected graph
connected components
graph theoretic
objective function
random walk
weighted graph
directed edges