Every rayless graph has an unfriendly partition.

Henning Bruhn Reinhard Diestel Agelos Georgakopoulos Philipp Sprüssel

Published in: Comb. (2010)

Keyphrases

partitioning algorithm
graph model
vertex set
graph theory
directed graph
graph structure
min cut
weighted graph
adjacency matrix
minimum spanning tree
graph partitioning
graph theoretic
data sets
spanning tree
structured data
graph representation
normalized cut
small world
bipartite graph
search algorithm