A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs.

Published in: J. Comb. Theory, Ser. B (1999)

Keyphrases

interactive theorem proving
random graphs
graph theory
graph matching
graph theoretic
topological information
topological features
degree distribution
connected components
graph mining
graph representation
series parallel
power law
linear logic
graph construction
data sets
random variables
image segmentation