Premium
A new sufficient condition for hamiltonian graphs
Author(s) -
Fraisse Pierre
Publication year - 1986
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190100316
Subject(s) - mathematics , combinatorics , hamiltonian (control theory) , graph , hamiltonian path , pancyclic graph , discrete mathematics , chordal graph , 1 planar graph , mathematical optimization
We prove that a k ‐connected graph of order n , such that the number of neighbors of every independent set of k vertices is greater than ( k ( n – 1))/( k + 1) is hamiltonian.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom