Every 4-Connected Graph with Crossing Number 2 is Hamiltonian.

Kenta Ozeki Carol T. Zamfirescu

Published in: SIAM J. Discret. Math. (2018)

Keyphrases

small number
connected components
maximum number
graph structure
data sets
random graphs
data structure
memory requirements
fixed number
bipartite graph
connected graphs
database
graph model
finite number
directed acyclic graph
graph matching
structured data
knowledge base
neural network