Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers.

Benedikt Klocker Herbert Fleischner Günther R. Raidl

Published in: HM (2016)

Keyphrases

spanning tree
maximum clique
minimum cost
random graphs
edge disjoint
small number
graph matching
genetic algorithm
random walk
directed graph
graph clustering
heavy tails