A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path.
Ilkyoo ChoiJinha KimPublished in: Discret. Appl. Math. (2020)
Keyphrases
- hamiltonian path
- graph theoretic
- connected components
- high quality
- sufficient conditions
- data sets
- neighborhood graph
- structured data
- graph theory
- directed graph
- combinatorial optimization
- random graphs
- directed acyclic graph
- bipartite graph
- binary images
- random walk
- knn
- data structure
- multiscale
- information retrieval