Premium
A chvátal–erdős type condition for hamiltonian graphs
Author(s) -
Lu Xiaoyun
Publication year - 1994
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.3190180804
Subject(s) - mathematics , combinatorics , hamiltonian (control theory) , hamiltonian path , graph , type (biology) , discrete mathematics , mathematical optimization , ecology , biology
For a simple graph G of order n ≧ 3, define θ( G ) = min{( d ( A , A ))/| A |; Ø ø A ≠ V }. We shall prove the following Chvátal–Erdős type condition: If α( G ) ≦ θ( G ) n , then G 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