Best monotone degree conditions for binding number

D. Bauer; M. Yatauro; N. Kahl; E. Schmeichel

doi:10.1016/j.disc.2011.04.034

Best monotone degree conditions for binding number

D. Bauer
, M. Yatauro
, N. Kahl
, E. Schmeichel

Penn State Brandywine

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

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 language	English (US)
Pages (from-to)	2037-2043
Number of pages	7
Journal	Discrete Mathematics
Volume	311
Issue number	18-19
DOIs	https://doi.org/10.1016/j.disc.2011.04.034
State	Published - Oct 6 2011

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2011.04.034

Cite this

@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 M. Yatauro and N. Kahl and E. Schmeichel",

year = "2011",

month = oct,

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 B.V.",

number = "18-19",

}

TY - JOUR

T1 - Best monotone degree conditions for binding number

AU - Bauer, D.

AU - Yatauro, M.

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 - https://www.scopus.com/pages/publications/79960292104

UR - https://www.scopus.com/pages/publications/79960292104#tab=citedBy

U2 - 10.1016/j.disc.2011.04.034

DO - 10.1016/j.disc.2011.04.034

M3 - Article

AN - SCOPUS:79960292104

SN - 0012-365X

VL - 311

SP - 2037

EP - 2043

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 18-19

ER -

Best monotone degree conditions for binding number

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this