More than one tough chordal planar graphs are Hamiltonian.

Thomas Böhme Jochen Harant Michal Tkác

Published in: J. Graph Theory (1999)

Keyphrases

planar graphs
undirected graph
directed graph
graph structure
graph coloring
minimum weight
higher order
complex networks
connected components
approximation algorithms
directed acyclic graph