TY - JOUR
T1 - Best monotone degree conditions for binding number and cycle structure
AU - Bauer, D.
AU - Nevo, A.
AU - Schmeichel, E.
AU - Woodall, D. R.
AU - Yatauro, M.
N1 - Publisher Copyright:
© 2013 Elsevier B.V. All rights reserved.
PY - 2015/11/20
Y1 - 2015/11/20
N2 - Woodall has shown that every 3/2-binding graph is hamiltonian. In this paper, we consider best monotone degree conditions for a b-binding graph to be hamiltonian, for 1≤b<3/2. We first establish such a condition for b=1. We then give a best monotone degree condition for a b-binding graph to be 1-tough, for 1<<3/2, and conjecture that this condition is also the best monotone degree condition for a b-binding graph to be hamiltonian, for 1<<3/2.
AB - Woodall has shown that every 3/2-binding graph is hamiltonian. In this paper, we consider best monotone degree conditions for a b-binding graph to be hamiltonian, for 1≤b<3/2. We first establish such a condition for b=1. We then give a best monotone degree condition for a b-binding graph to be 1-tough, for 1<<3/2, and conjecture that this condition is also the best monotone degree condition for a b-binding graph to be hamiltonian, for 1<<3/2.
UR - http://www.scopus.com/inward/record.url?scp=84941413415&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84941413415&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2013.12.014
DO - 10.1016/j.dam.2013.12.014
M3 - Article
AN - SCOPUS:84941413415
SN - 0166-218X
VL - 195
SP - 8
EP - 17
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
ER -