C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Tough enough chordal graphs are Hamiltonian.
Guantao Chen
Michael S. Jacobson
André E. Kézdy
Jenö Lehel
Published in:
Networks (1998)
Keyphrases
</>
undirected graph
random graphs
graph theoretic
directed graph
graph theory
graph structure
graph matching
attributed graphs
real time
maximal cliques
graph representation
graph databases
graph mining
connected components
scheduling problem
pattern recognition
data structure
information systems