(1) Campus de Schoelcher, UAG-CEREGMIA-GRIMAAG, B.P. 7209, 97275, Schoelcher Cedex, Martinique, France;(2) Department of Mathematics, Technical University of Freiberg, D-09596 Freiberg, Germany
Abstract:
We prove that for almost all sufficient conditions based on degree sums or neighborhood unions of 3-independent sets for a graph G to be hamiltonian imply that the 0-dual closure of G is complete. The proofs are very short.