Best monotone degree conditions for binding number

D. Bauer, Michael Robert Yatauro, N. Kahl, E. Schmeichel

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

We give sufficient conditions on the vertex degrees of a graph G to guarantee that G has binding number at least b, for any given b>0. Our conditions are best possible in exactly the same way that Chvátal's well-known degree condition to guarantee a graph is Hamiltonian is best possible.

Original languageEnglish (US)
Pages (from-to)2037-2043
Number of pages7
JournalDiscrete Mathematics
Volume311
Issue number18-19
DOIs
StatePublished - Oct 6 2011

Fingerprint

Degree Condition
Hamiltonians
Monotone
Vertex Degree
Graph in graph theory
Sufficient Conditions

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

Bauer, D. ; Yatauro, Michael Robert ; Kahl, N. ; Schmeichel, E. / Best monotone degree conditions for binding number. In: Discrete Mathematics. 2011 ; Vol. 311, No. 18-19. pp. 2037-2043.
@article{312b9b986d824ba19a0ed3ecd27aa65d,
title = "Best monotone degree conditions for binding number",
abstract = "We give sufficient conditions on the vertex degrees of a graph G to guarantee that G has binding number at least b, for any given b>0. Our conditions are best possible in exactly the same way that Chv{\'a}tal's well-known degree condition to guarantee a graph is Hamiltonian is best possible.",
author = "D. Bauer and Yatauro, {Michael Robert} and N. Kahl and E. Schmeichel",
year = "2011",
month = "10",
day = "6",
doi = "10.1016/j.disc.2011.04.034",
language = "English (US)",
volume = "311",
pages = "2037--2043",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "18-19",

}

Best monotone degree conditions for binding number. / Bauer, D.; Yatauro, Michael Robert; Kahl, N.; Schmeichel, E.

In: Discrete Mathematics, Vol. 311, No. 18-19, 06.10.2011, p. 2037-2043.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Best monotone degree conditions for binding number

AU - Bauer, D.

AU - Yatauro, Michael Robert

AU - Kahl, N.

AU - Schmeichel, E.

PY - 2011/10/6

Y1 - 2011/10/6

N2 - We give sufficient conditions on the vertex degrees of a graph G to guarantee that G has binding number at least b, for any given b>0. Our conditions are best possible in exactly the same way that Chvátal's well-known degree condition to guarantee a graph is Hamiltonian is best possible.

AB - We give sufficient conditions on the vertex degrees of a graph G to guarantee that G has binding number at least b, for any given b>0. Our conditions are best possible in exactly the same way that Chvátal's well-known degree condition to guarantee a graph is Hamiltonian is best possible.

UR - http://www.scopus.com/inward/record.url?scp=79960292104&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79960292104&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2011.04.034

DO - 10.1016/j.disc.2011.04.034

M3 - Article

VL - 311

SP - 2037

EP - 2043

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 18-19

ER -