Partitions of graphs with high minimum degree or connectivity.

Daniela Kühn Deryk Osthus

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

Keyphrases

wide range
directed graph
spanning tree
random graphs
clustering algorithm
connected components
low degree
graph theoretic
connected dominating set
database
dominating set
topological information
subgraph isomorphism
graph representation
graph structure
bipartite graph
high precision
neural network