10-tough chordal graphs are Hamiltonian.

Adam Kabela Tomás Kaiser

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

Keyphrases

undirected graph
graph matching
graph theory
graph structure
graph representation
graph theoretic
case study
pattern recognition
graph databases
data structure
constraint satisfaction
bipartite graph
spanning tree
random graphs
graph structures