Authors
Citation
A. Ainouche, A SHORT PROOF OF A THEOREM ON HAMILTONIAN GRAPHS, Journal of graph theory, 22(1), 1996, pp. 83-87
Citations number
6
Categorie Soggetti
Mathematics, Pure",Mathematics
Journal title
ISSN journal
03649024
Volume
22
Issue
1
Year of publication
1996
Pages
83 - 87
Database
ISI
SICI code
0364-9024(1996)22:1<83:ASPOAT>2.0.ZU;2-E
Abstract
In this note,we give a short proof of a stronger version of the follow
ing theorem: Let G be a 2-connected graph of order n such that d(u) d(v)+ d(w) greater than or equal to n + \N(u) boolean AND N(v) boolean
AND n(w)\ for any independent set {u, v, w}, then G is hamiltonian. (
C) 1996 John Wiley & Sons, Inc.