A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs.
Karl HeuerPublished in: Eur. J. Comb. (2016)
Keyphrases
- random graphs
- sufficient conditions
- graph theory
- globally consistent
- graph matching
- finite number
- graph representation
- weighted graph
- graph mining
- unit length
- graph theoretic
- graph partitioning
- graph structure
- bipartite graph
- information systems
- graph model
- similarity measure
- graph data
- data mining
- maximal cliques
- data sets