The graphs for which all strong orientations are hamiltonian.

Martin Grötschel Frank Harary

Published in: J. Graph Theory (1979)

Keyphrases

graph theory
graph theoretic
search algorithm
directed graph
graph matching
graph databases
undirected graph
graph mining
labeled graphs
real world
subgraph isomorphism
graph coloring
graph partitioning
weighted graph
social network analysis
data structure
multiscale
high level
machine learning