article

Best Monotone Degree Conditions for Graph Properties: A Survey

Authors:

D. Bauer,

H. J. Broersma,

J. Heuvel,

N. Kahl,

A. Nevo,

E. Schmeichel,

D. R. Woodall,

M. YatauroAuthors Info & Claims

Graphs and Combinatorics, Volume 31, Issue 1

Pages 1 - 22

https://doi.org/10.1007/s00373-014-1465-6

Published: 01 January 2015 Publication History

Abstract

We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvátal's well-known degree condition for hamiltonicity is best possible.

References

[1]

Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, New York (1992)

Google Scholar

[2]

Anderson, I.: Perfect matchings of a graph. J. Combin. Theory Ser. B 10, 183---186 (1971)

Crossref

Google Scholar

[3]

Bauer, D., Broersma, H.J., van den Heuvel, J., Kahl, N., Schmeichel, E.: Degree sequences and the existence of $$k$$k-factors. Graphs Combin. 28, 149---166 (2012)

Digital Library

Google Scholar

[4]

Bauer, D., Broersma, H.J., van den Heuvel, J., Kahl, N., Schmeichel, E.: Toughness and vertex degrees. J. Graph Theory 72, 209---219 (2013)

Digital Library

Google Scholar

[5]

Bauer, D., Broersma, H.J., Veldman, H.J.: Not every 2-tough graph is hamiltonian. Discrete Appl. Math. 99, 317---321 (2000)

Digital Library

Google Scholar

[6]

Bauer, D., Hakimi, S.L., Kahl, N., Schmeichel, E.: Sufficient degree conditions for $$k$$k-edge-connectedness of a graph. Networks 54, 95---98 (2009)

Digital Library

Google Scholar

[7]

Bauer, D., Hakimi, S.L., Schmeichel, E.: Recognizing tough graphs is NP-hard. Discrete Appl. Math. 28, 191---195 (1990)

Digital Library

Google Scholar

[8]

Bauer, D., Kahl, N., Schmeichel, E., Woodall, D.R., Yatauro, M.: Improving theorems in a best monotone sense. Congr. Numer. 216, 87---95 (2013)

Google Scholar

[9]

Bauer, D., Kahl, N., Schmeichel, E., Woodall, D.R., Yatauro, M.: Toughness and binding number. Discrete Appl. Math. 165, 60---68 (2014)

Digital Library

Google Scholar

[10]

Bauer, D., Kahl, N., Schmeichel, E., Yatauro, M.: Best monotone degree conditions for binding number. Discrete Math. 311, 2037---2043 (2011)

Digital Library

Google Scholar

[11]

Bauer, D., Morgana, A., Schmeichel, E.F.: A simple proof of a theorem of Jung. Discrete Math. 79, 147---152 (1989/1990)

Crossref

Google Scholar

[12]

Bauer, D., Nevo, A., Schmeichel, E.: Best monotone condition for 1-tough $$\Rightarrow $$¿ 2-factor (in preparation)

Google Scholar

[13]

Bauer, D., Nevo, A., Schmeichel, E.: Best monotone condition for 2-factor $$\Rightarrow $$¿ 1-tough (in preparation)

Google Scholar

[14]

Bauer, D., Nevo, A., Schmeichel, E.: Note on binding number, vertex degrees, and 1-factors (in preparation)

Google Scholar

[15]

Bauer, D., Nevo, A., Schmeichel, E.: Vertex arboricity and vertex degrees (in preparation)

Google Scholar

[16]

Bauer, D., Nevo, A., Schmeichel, E., Woodall, D.R., Yatauro, M.: Best monotone degree conditions for binding number and cycle structure. Discrete Appl. Math. (2014).

Crossref

Google Scholar

[17]

Bauer, D., Schmeichel, E.: Hamiltonian degree conditions which imply a graph is pancyclic. J. Combin. Theory Ser. B 48, 111---116 (1990)

Digital Library

Google Scholar

[18]

Bauer, D., Schmeichel, E.: Binding number, minimum degree, and cycle structure in graphs. J. Graph Theory 71, 219---228 (2012)

Digital Library

Google Scholar

[19]

Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)

Crossref

Google Scholar

[20]

Boesch, F.: The strongest monotone degree condition for $$n$$n-connectedness of a graph. J. Combin. Theory Ser. B 16, 162---165 (1974)

Crossref

Google Scholar

[21]

Bondy, J.A.: Properties of graphs with constraints on degrees. Studia Sci. Math. Hungar. 4, 473---475 (1969)

Google Scholar

[22]

Bondy, J.A., Chvátal, V.: A method in graph theory. Discrete Math. 15, 111---135 (1976)

Digital Library

Google Scholar

[23]

Brooks, R.L.: On colouring the nodes of a network. Proc. Camb. Philos. Soc. 37, 194---197 (1941)

Crossref

Google Scholar

[24]

Caro, Y.: New results on the independence number. Technical Report 05---79, Tel-Aviv University (1979)

Google Scholar

[25]

Chartrand, G., Harary, F.: Graphs with prescribed connectivities. In: Theory of Graphs, pp. 61---63. Academic Press, New York (1968)

Google Scholar

[26]

Chartrand, G., Kapoor, S.F., Kronk, H.V.: A sufficient condition for $$n$$n-connectedness of graphs. Mathematika 15, 51---52 (1968)

Crossref

Google Scholar

[27]

Chartrand, G., Kronk, H.V.: The point arboricity of planar graphs. J. Lond. Math. Soc. 44, 612---616 (1969)

Crossref

Google Scholar

[28]

Chartrand, G., Lesniak, L., Zhang, P.: Graphs and Digraphs, 5th edn. CRC Press, Boca Raton (2011)

Google Scholar

[29]

Chen, C.: Binding number and toughness for matching extension. Discrete Math. 146, 303---306 (1995)

Crossref

Google Scholar

[30]

Chvátal, V.: On Hamilton's ideals. J. Combin. Theory Ser. B 12, 163---168 (1972)

Crossref

Google Scholar

[31]

Chvátal, V.: Tough graphs and hamiltonian circuits. Discrete Math. 5, 215---228 (1973)

Digital Library

Google Scholar

[32]

Cunningham, W.H.: Computing the binding number of a graph. Discrete Appl. Math. 27, 283---285 (1990)

Digital Library

Google Scholar

[33]

Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. (3) 2, 69---81 (1952)

Crossref

Google Scholar

[34]

Egawa, Y., Enomoto, H.: Sufficient conditions for the existence of $$k$$k-factors. In: Recent Studies in Graph Theory, pp. 96---105. Vishwa, Gulbarga (1989)

Google Scholar

[35]

Gallai, T.: On directed paths and circuits. In: Theory of Graphs, pp. 115---118. Academic Press, New York (1968)

Google Scholar

[36]

Hakimi, S.L., Schmeichel, E.F.: A note on the vertex arboricity of a graph. SIAM J. Discrete Math. 2, 64---67 (1989)

Digital Library

Google Scholar

[37]

Hardy, G.H., Ramanujan, S.: Asymptotic formulae in combinatory analysis. Proc. Lond. Math. Soc. 17, 75---115 (1918)

Crossref

Google Scholar

[38]

Hoàng, C.T.: Hamiltonian degree conditions for tough graphs. Discrete Math. 142, 121---139 (1995)

Digital Library

Google Scholar

[39]

Jung, H.A.: On maximal circuits in finite graphs. Ann. Discrete Math. 3, 129---144 (1978)

Crossref

Google Scholar

[40]

Kane, V.G., Mohanty, S.P.: Binding numbers, cycles and complete graphs. In: Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol. 885, pp. 290---296. Springer, Berlin (1981)

Google Scholar

[41]

Katerinis, P., Woodall, D.R.: Binding numbers of graphs and the existence of $$k$$k-factors. Q. J. Math. Oxford Ser. (2) 38, 221---228 (1987)

Crossref

Google Scholar

[42]

Kriesell, M.: Degree sequences and edge connectivity. http://www.math.uni-hamburg.de/research/papers/hbm/hbm2007282 (2007) (preprint)

Google Scholar

[43]

Kronk, H.V.: A note on $$k$$k-path hamiltonian graphs. J. Combin. Theory 7, 104---106 (1969)

Crossref

Google Scholar

[44]

Las Vergnas, M.: Problèmes de Couplages et Problèmes Hamiltoniens en Théorie des Graphes. PhD Thesis, Université Paris VI--Pierre et Marie Curie (1972)

Google Scholar

[45]

Lesniak, L.: On $$n$$n-hamiltonian graphs. Discrete Math. 14, 165---169 (1976)

Digital Library

Google Scholar

[46]

Lyle, J., Goddard, W.: The binding number of a graph and its cliques. Discrete Appl. Math. 157, 3336---3340 (2009)

Digital Library

Google Scholar

[47]

Murphy, O.: Lower bounds on the stability number of graphs computed in terms of degrees. Discrete Math. 90, 207---211 (1991)

Digital Library

Google Scholar

[48]

Nash-Williams, C.St.J.A.: Hamiltonian arcs and circuits. In: Recent Trends in Graph Theory. Lecture Notes in Mathematics, vol. 186, pp. 197---210. Springer, Berlin (1971)

Google Scholar

[49]

Pósa, L.: A theorem concerning Hamilton lines. Magyar Tud. Akad. Mat. Kutató Int. Közl. 7, 225---226 (1962)

Google Scholar

[50]

Rao, A.R.: The clique number of a graph with a given degree sequence. In: Proceedings of Symposium on Graph Theory. ISI Lecture Notes Series, vol. 4, pp. 251---267. (1979)

Google Scholar

[51]

Robertshaw, A.M., Woodall, D.R.: Triangles and neighbourhoods of independent sets in graphs. J. Combin. Theory Ser. B 80, 122---129 (2000)

Digital Library

Google Scholar

[52]

Shi, R.: The binding number of a graph and its pancyclism. Acta Math. Appl. Sinica (English Series) 3, 257---269 (1987)

Google Scholar

[53]

Szekeres, G., Wilf, H.S.: An inequality for the chromatic number of a graph. J. Combin. Theory 4, 1---3 (1968)

Crossref

Google Scholar

[54]

Tutte, W.T.: A short proof of the factor theorem for finite graphs. Can. J. Math. 6, 347---352 (1954)

Crossref

Google Scholar

[55]

Wei, V.K.: A lower bound on the stability number of a simple graph. Technical Memorandum TM 81---11217-9, Bell Laboratories (1981)

Google Scholar

[56]

Welsh, D.J.A., Powell, M.B.: An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10, 85---86 (1967)

Crossref

Google Scholar

[57]

West, D.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)

Google Scholar

[58]

Wilf, H.S.: The eigenvalues of a graph and its chromatic number. J. Lond. Math. Soc. 42, 330---332 (1967)

Crossref

Google Scholar

[59]

Woodall, D.R.: The binding number of a graph and its Anderson number. J. Combin. Theory Ser. B 15, 225---255 (1973)

Crossref

Google Scholar

[60]

Woodall, D.R.: A sufficient condition for hamiltonian circuits. J. Combin. Theory Ser. B 25, 184---186 (1978)

Crossref

Google Scholar

[61]

Woodall, D.R.: $$k$$k-factors and neighbourhoods of independent sets in graphs. J. Lond. Math. Soc. (2) 41, 385---392 (1990)

Crossref

Google Scholar

[62]

Yin, J.-H., Guo, J.-Y.: Forcibly $$k$$k-edge-connected graphic sequences (to appear, 2014)

Google Scholar

Cited By

View all

Liu HYou LHuang YDu Z(2024)On sufficient conditions for Hamiltonicity of graphs, and beyondJournal of Combinatorial Optimization10.1007/s10878-024-01110-447:2Online publication date: 23-Feb-2024
https://dl.acm.org/doi/10.1007/s10878-024-01110-4
Yatauro M(2021)Stability Theorems for Graph Vulnerability ParametersGraphs and Combinatorics10.1007/s00373-020-02239-937:1(221-239)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1007/s00373-020-02239-9
Barrus M(2018)Adjacency Relationships Forced by a Degree SequenceGraphs and Combinatorics10.1007/s00373-018-1953-134:6(1411-1427)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s00373-018-1953-1
Show More Cited By

Best Monotone Degree Conditions for Graph Properties: A Survey
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Best monotone degree conditions for binding number and cycle structure

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 ...
On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs

Let G be a connected k-regular vertex-transitive graph on n vertices. For S V(G) let d(S) denote the number of edges between S and V(G)\S. We extend results of Mader and Tindell by showing that if d(S)<29(k+1)2 for some S V(G) with 13(k+1) |S| 12n, then ...
Local Degree Conditions for Hamiltonicity of Claw-Free Graphs
Abstract
Let G be a 2-connected claw-free graph on n vertices. For a vertex $v \in V (G)$ and an integer $r \geq 1$ , $M^{r} (v)$ denotes the set of vertices of G whose distances from v do not exceed r. Matthews and Sumner in 1985 proved that G is hamiltonian if $d (v) \geq \frac{n - 2}{3}$ for ... $\frac{^{}}{}$ $\frac{^{}}{}$ $\frac{}{}$

Comments

Information & Contributors

Information

Published In

Graphs and Combinatorics Volume 31, Issue 1

January 2015

309 pages

ISSN:0911-0119

EISSN:1435-5914

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 January 2015

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu HYou LHuang YDu Z(2024)On sufficient conditions for Hamiltonicity of graphs, and beyondJournal of Combinatorial Optimization10.1007/s10878-024-01110-447:2Online publication date: 23-Feb-2024
https://dl.acm.org/doi/10.1007/s10878-024-01110-4
Yatauro M(2021)Stability Theorems for Graph Vulnerability ParametersGraphs and Combinatorics10.1007/s00373-020-02239-937:1(221-239)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1007/s00373-020-02239-9
Barrus M(2018)Adjacency Relationships Forced by a Degree SequenceGraphs and Combinatorics10.1007/s00373-018-1953-134:6(1411-1427)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.1007/s00373-018-1953-1
Bauer DNevo ASchmeichel E(2017)Best Monotone Degree Condition for the Hamiltonicity of Graphs with a 2-FactorGraphs and Combinatorics10.1007/s00373-017-1840-133:5(1231-1248)Online publication date: 1-Sep-2017
https://dl.acm.org/doi/10.1007/s00373-017-1840-1
Bauer DNevo ASchmeichel E(2016)Vertex Arboricity and Vertex DegreesGraphs and Combinatorics10.1007/s00373-016-1697-832:5(1699-1705)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1007/s00373-016-1697-8

Abstract

References

Cited By

Recommendations

Best monotone degree conditions for binding number and cycle structure

On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs

Local Degree Conditions for Hamiltonicity of Claw-Free Graphs

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations