A clique-covering sufficient condition for hamiltonicity of graphs.

Alain Bretto Thierry Vallée

Published in: Inf. Process. Lett. (2009)

Keyphrases

sufficient conditions
maximum clique
independent set
graph properties
asymptotic stability
quasi cliques
fixed point
lyapunov function
exponential stability
neural network
linear systems
uniform convergence
maximum weight
graph mining
bipartite graph
special case
equilibrium point
genetic algorithm