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 Scopus citations

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 languageEnglish (US)
Pages (from-to)8-17
Number of pages10
JournalDiscrete Applied Mathematics
Volume195
DOIs
StatePublished - Nov 20 2015

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Best monotone degree conditions for binding number and cycle structure'. Together they form a unique fingerprint.

  • Cite this