# Best monotone degree conditions for binding number and cycle structure

D. Bauer, A. Nevo, E. Schmeichel, D. R. Woodall, M. Yatauro

Research output: Contribution to journalArticle

2 Citations (Scopus)

### Abstract

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.

Original language English (US) 8-17 10 Discrete Applied Mathematics 195 https://doi.org/10.1016/j.dam.2013.12.014 Published - Nov 20 2015

### Fingerprint

Degree Condition
Hamiltonians
Monotone
Cycle
Graph in graph theory

### All Science Journal Classification (ASJC) codes

• Discrete Mathematics and Combinatorics
• Applied Mathematics

### Cite this

Bauer, D. ; Nevo, A. ; Schmeichel, E. ; Woodall, D. R. ; Yatauro, M. / Best monotone degree conditions for binding number and cycle structure. In: Discrete Applied Mathematics. 2015 ; Vol. 195. pp. 8-17.
@article{3ebf23c7ec2e4a2b9956dd33afd07f5a,
title = "Best monotone degree conditions for binding number and cycle structure",
abstract = "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.",
author = "D. Bauer and A. Nevo and E. Schmeichel and Woodall, {D. R.} and M. Yatauro",
year = "2015",
month = "11",
day = "20",
doi = "10.1016/j.dam.2013.12.014",
language = "English (US)",
volume = "195",
pages = "8--17",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",

}

Best monotone degree conditions for binding number and cycle structure. / Bauer, D.; Nevo, A.; Schmeichel, E.; Woodall, D. R.; Yatauro, M.

In: Discrete Applied Mathematics, Vol. 195, 20.11.2015, p. 8-17.

Research output: Contribution to journalArticle

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.

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

VL - 195

SP - 8

EP - 17

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -