Toughness in Graphs – A Survey

In this survey we have attempted to bring together most of the results and papers that deal with toughness related to cycle structure. We begin with a brief introduction and a section on terminology and notation, and then try to organize the work into a few self explanatory categories. These categories are circumference, the disproof of the 2-tough conjecture, factors, special graph classes, computational complexity, and miscellaneous results as they relate to toughness. We complete the survey with some tough open problems!

[1]  Douglas Bauer,et al.  On Hamiltonian properties of 2-tough graphs , 1992 .

[2]  Jochen Harant Toughness and nonhamiltonicity of polyhedral graphs , 1993, Discret. Math..

[3]  Richard D. Ringeisen,et al.  On the Vulnerability of Cycle Permutation Graphs , 1990 .

[4]  R. Möhring Algorithmic graph theory and perfect graphs , 1986 .

[5]  Paul Erdös,et al.  A note on Hamiltonian circuits , 1972, Discret. Math..

[6]  Dinoj Surendran,et al.  The three colour problem , 1999 .

[7]  G. Dirac Some Theorems on Abstract Graphs , 1952 .

[8]  Geng-Hua Fan,et al.  New sufficient conditions for cycles in graphs , 1984, J. Comb. Theory, Ser. B.

[9]  H. A. Jung On Maximal Circuits in Finite Graphs , 1978 .

[10]  Edward F. Schmeichel,et al.  Connectivity, genus, and the number of components in vertex-deleted subgraphs , 1979, J. Comb. Theory, Ser. B.

[11]  Hikoe Enomoto,et al.  Toughness and the existence of k-factors. IV , 2000, Discret. Math..

[12]  T. Gerlach Toughness and Hamiltonicity of a class of planar graphs , 2004, Discret. Math..

[13]  Edward F. Schmeichel,et al.  A simple proof of a theorem of Jung , 1990, Discret. Math..

[14]  Edward F. Schmeichel,et al.  Progress on tough graphs - Another four years , 1996 .

[15]  Douglas Bauer,et al.  Long cycles in graphs with prescribed toughness and minimum degree , 1995, Discret. Math..

[16]  Douglas Bauer,et al.  Around Three Lemmas in Hamiltonian Graph Theory , 1990 .

[17]  Vu Dinh Hoa A sharp lower bound for the circumference of 1-tough graphs with large degree sums , 1995, J. Graph Theory.

[18]  Edward F. Schmeichel,et al.  A note on dominating cycles in 2-connected graphs , 1996, Discret. Math..

[19]  Vu-dinh-hoa A Remark on Hamiltonian Cycles , 1992 .

[20]  Lynne L. Doty A large class of maximally tough graphs , 1991 .

[21]  J. Moon,et al.  On Hamiltonian bipartite graphs , 1963 .

[22]  O. Ore Note on Hamilton Circuits , 1960 .

[23]  Jianping Li Cycles Containing Many Vertices of Subsets in 1-Tough Graphs with Large Degree Sums , 1998, Ars Comb..

[24]  Edward F. Schmeichel,et al.  Toughness, minimum degree, and the existence of 2-factors , 1994, J. Graph Theory.

[25]  N. Alon Tough Ramsey Graphs Without Short Cycles , 1995 .

[26]  Nathan Linial A lower bound for the circumference of a graph , 1976, Discret. Math..

[27]  Alan A. Bertossi,et al.  The Edge Hamiltonian Path Problem is NP-Complete , 1981, Inf. Process. Lett..

[28]  S. F. Kapoor,et al.  The Many Facets of Graph Theory , 1969 .

[29]  Hajo Broersma,et al.  Toughness and hamiltonicity in k-trees , 2007, Discret. Math..

[30]  Thomas Böhme,et al.  Toughness and longest cycles in 2-connected planar graphs , 1996, J. Graph Theory.

[31]  Ciping Chen Toughness of Graphs and [2,b]-Factors , 1994, Graphs Comb..

[32]  M. Golumbic CHAPTER 3 – Perfect Graphs , 1980 .

[33]  M. Watkins,et al.  A theorem on tait colorings with an application to the generalized Petersen graphs , 1969 .

[34]  Hoa Vu Dinh On the length of longest dominating cycles in graphs , 1993, Discret. Math..

[35]  Miklós Simonovits,et al.  Longest Cycles in 3-Connected 3-Regular Graphs , 1980, Canadian Journal of Mathematics.

[36]  Gerhard J. Woeginger The toughness of split graphs , 1998, Discret. Math..

[37]  Odile Favaron,et al.  On k-factor-critical graphs , 1996, Discuss. Math. Graph Theory.

[38]  Edward F. Schmeichel,et al.  Cycles in tough graphs- updating the last four years , 1995 .

[39]  Jan van den Heuvel,et al.  Long cycles, degree sums and neighborhood unions , 1993, Discret. Math..

[40]  Edward F. Schmeichel,et al.  2-factors in triangle-free graphs , 1996 .

[41]  Siming Zhan,et al.  On hamiltonian line graphs and connectivity , 1991, Discret. Math..

[42]  Wayne Goddard Measures of vulnerability-the integrity family , 1994, Networks.

[43]  Satoru Iwata,et al.  Submodular function minimization , 2007, Math. Program..

[44]  Henk Jan Veldman,et al.  Existence of dominating cycles and paths , 1983, Discret. Math..

[45]  Michael D. Plummer Toughness and matching extension in graphs , 1988, Discret. Math..

[46]  C. Springer-Verlag,et al.  Toughness and the Existence of k-Factors. II , 1986 .

[47]  Michael S. Jacobson,et al.  Tough enough chordal graphs are Hamiltonian , 1998, Networks.

[48]  David P. Sumner,et al.  Hamiltonian results in K1, 3-free graphs , 1984, J. Graph Theory.

[49]  Jan Mycielski Sur le coloriage des graphs , 1955 .

[50]  P. Katerinis Two sufficient conditions for a 2-factor in a bipartite graph , 1987, J. Graph Theory.

[51]  Takao Nishizeki A 1-tough nonhamiltonian maximal planar graph , 1980, Discret. Math..

[52]  Douglas Bauer,et al.  Not Every 2-tough Graph Is Hamiltonian , 2000, Discret. Appl. Math..

[53]  Edward F. Schmeichel,et al.  Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion , 2002, Discret. Appl. Math..

[54]  Chính T. Hoàng,et al.  Hamiltonian degree conditions for tough graphs , 1995, Discret. Math..

[55]  Bing Wei Hamiltonian cycles in 1-tough graphs , 1996, Graphs Comb..

[56]  Mark N. Ellingham,et al.  Toughness, trees, and walks , 2000, J. Graph Theory.

[57]  J. Mark Keil Finding Hamiltonian Circuits in Interval Graphs , 1985, Inf. Process. Lett..

[58]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[59]  Kevin Ferland Toughness of Generalized Petersen Graphs , 2003, Ars Comb..

[60]  Jochen Harant,et al.  Non-hamiltonian 4/5-tough maximal planar graphs , 1995, Discret. Math..

[61]  H. A. Jung,et al.  Longest cycles in tough graphs , 1999, J. Graph Theory.

[62]  Jan van den Heuvel,et al.  Long paths and cycles in tough graphs , 1993, Graphs Comb..

[63]  Mark N. Ellingham,et al.  Connected (g, f)‐factors , 2002, J. Graph Theory.

[64]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[65]  Roland Häggkvist,et al.  A remark on Hamiltonian cycles , 1981, J. Comb. Theory, Ser. B.

[66]  Hao Li Circumferences in 1-tough graphs , 1995, Discret. Math..

[67]  V. Chvátal On Hamilton's ideals , 1972 .

[68]  Edward F. Schmeichel,et al.  Tutte sets in graphs II: The complexity of finding maximum Tutte sets , 2007, Discret. Appl. Math..

[69]  Bill Jackson,et al.  Longest cycles in 3-connected planar graphs , 1992, J. Comb. Theory, Ser. B.

[70]  W. T. Tutte A THEOREM ON PLANAR GRAPHS , 1956 .

[71]  Jochen Harant,et al.  More than one tough chordal planar graphs are Hamiltonian , 1999, J. Graph Theory.

[72]  Nicos Christofides,et al.  Conditions for the existence of Hamiltonian circuits in graphs based on vertex degrees , 1985 .

[73]  Mehdi Behzad,et al.  Graphs and Digraphs , 1981, The Mathematical Gazette.

[74]  Edward F. Schmeichel,et al.  Some recent results on long cycles in tough graphs , 1991 .

[75]  Minyong Shi,et al.  (3,k)-Factor-Critical Graphs and Toughness , 1999, Graphs Comb..

[76]  Zdeněk Ryjáčk On a Closure Concept in Claw-Free Graphs , 1997 .

[77]  John Adrian Bondy,et al.  Large cycles in graphs , 1971, Discret. Math..

[78]  H. Veldman,et al.  Degree sums for edges and cycle lengths in graphs , 1997 .

[79]  Carsten Thomassen,et al.  Reflections on graph theory , 1986, J. Graph Theory.

[80]  Edward F. Schmeichel,et al.  Long cycles in graphs with large degree sums , 1990, Discret. Math..

[81]  D. Frank Hsu,et al.  Graph Theory, Combinatorics, Algorithms, and Applications , 1991 .

[82]  Xingxing Yu,et al.  Long Cycles in 3-Connected Graphs , 2002, J. Comb. Theory, Ser. B.

[83]  Edward F. Schmeichel,et al.  On the complexity of recognizing tough graphs , 1994, Discret. Math..

[84]  D. R. Woodall The binding number of a graph and its Anderson number , 1973 .

[85]  Henk Jan Veldman,et al.  Updated contributions to the Twente Workshop on Hamiltonian Graph Theory , 1992 .

[86]  Gyula Y. Katona Properties of Edge-Tough Graphs , 1999, Graphs Comb..

[87]  H. Fleischner The square of every two-connected graph is Hamiltonian , 1974 .

[88]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[89]  Hikoe Enomoto Toughness and the existence ofk-factors. II , 1986, Graphs Comb..

[90]  Michal Tkác On the shortness exponent of 1-tough, maximal planar graphs , 1996, Discret. Math..

[91]  Zdenek Ryjácek On a Closure Concept in Claw-Free Graphs , 1997, J. Comb. Theory, Ser. B.

[92]  Carsten Thomassen Long Cycles in Digraphs , 1981 .

[93]  Edward F. Schmeichel,et al.  Toughness, minimum degree, and spanning cubic subgraphs , 2004, J. Graph Theory.

[94]  Edward F. Schmeichel,et al.  More Progress on Tough Graphs - The Y2K Report , 2002, Electron. Notes Discret. Math..

[95]  Vasek Chvátal,et al.  Tough graphs and hamiltonian circuits , 1973, Discret. Math..

[96]  Douglas Bauer,et al.  Hamiltonian properties of graphs with large neighborhood unions , 1991, Discret. Math..

[97]  M. Murty Ramanujan Graphs , 1965 .

[98]  Edward F. Schmeichel,et al.  The Complexity of Recognizing Tough Cubic Graphs , 1997, Discret. Appl. Math..

[99]  Douglas Bauer,et al.  On generalizing a theorem of Jung , 1995, Ars Comb..

[100]  Dieter Kratsch,et al.  Toughness, hamiltonicity and split graphs , 1996, Discret. Math..

[101]  Yousef Alavi,et al.  Graph theory, combinatorics, and applications : proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, Western Michigan University , 1991 .

[102]  A. Bigalke,et al.  Über Hamiltonsche Kreise und unabhängige Ecken in Graphen , 1979 .

[103]  Hikoe Enomoto,et al.  Toughness and the existence of k-factors , 1985, J. Graph Theory.

[104]  John B. Kelly,et al.  PATHS AND CIRCUITS IN CRITICAL GRAPHS. , 1954 .

[105]  Roland Häggkvist On the structure of Non-Hamiltonian Graphs 1 , 1992, Comb. Probab. Comput..

[106]  Abebe Geletu,et al.  On Robustness of Set-Valued Maps and Marginal Value Functions , 1998 .

[107]  Wayne Goddard,et al.  Maximum and minimum toughness of graphs of small genus , 1997, Discret. Math..

[108]  Hansjoachim Walther,et al.  Shortness Exponents of Families of Graphs , 1973, J. Comb. Theory, Ser. A.

[109]  Jochen Harant,et al.  More than one tough chordal planar graphs are Hamiltonian , 1999 .

[110]  Hikoe Enomoto Toughness and the existence of k-factors. III , 1998, Discret. Math..

[111]  Jitender S. Deogun,et al.  1-Tough cocomparability graphs are hamiltonian , 1997, Discret. Math..

[112]  Hajo Broersma,et al.  Various results on the toughness of graphs , 1999, Networks.

[113]  P. Erdös,et al.  Graph Theory and Probability , 1959 .

[114]  Jean-Claude Bermond On hamiltonian walks , 1976 .

[115]  Edward F. Schmeichel,et al.  Toughness and Triangle-Free Graphs , 1995, J. Comb. Theory, Ser. B.

[116]  S. Louis Hakimi,et al.  Recognizing tough graphs is NP-hard , 1990, Discret. Appl. Math..

[117]  P. Katerinis Toughness of graphs and the existence of factors , 1990, Discret. Math..

[118]  Akira Saito,et al.  Toughness, degrees and 2-factors , 2004, Discret. Math..

[119]  Odile Favaron,et al.  (2,k)-Factor-Critical Graphs and Toughness , 1999, Graphs Comb..

[120]  Bing Wei A generalization of a result of Bauer and Schmeichel , 1993, Graphs Comb..

[121]  Lowell W. Beineke More Measures of Vulnerability : Splinter Sets and , .

[122]  Michael B. Dillencourt An upper bound on the shortness exponent of 1-tough, maximal planar graphs , 1991, Discret. Math..

[123]  Michael B. Dillencourt On the toughness index of planar graphs , 1994 .

[124]  Henk Jan Veldman,et al.  Progress Report: EIDMA Workshop on Hamiltonicity of 2-tough graphs , 1996 .

[125]  Margit Voigt,et al.  A not 3-choosable planar graph without 3-cycles , 1995, Discret. Math..

[126]  Dieter Kratsch,et al.  Chordality and 2-factors in Tough Graphs , 2000, Discret. Appl. Math..

[127]  Wayne Goddard,et al.  On the Toughness of a Graph , 1990 .

[128]  Sein Win,et al.  On a connection between the existence ofk-trees and the toughness of a graph , 1989, Graphs Comb..

[129]  L. Markus Hamiltonian Results in K(l,r)-Free Graphs , 1993 .

[130]  Peter Dankelmann,et al.  On Path-Tough Graphs , 1994, SIAM J. Discret. Math..

[131]  J. Bondy,et al.  Pancyclic graphs II , 1971 .

[132]  Wayne Goddard,et al.  Weakly pancyclic graphs , 1998, J. Graph Theory.

[133]  C. Nash-Williams,et al.  Hamiltonian circuits in graphs and digraphs , 1969 .

[134]  Douglas Bauer,et al.  A generalization of a result of Häggkvist and Nicoghossian , 1989, J. Comb. Theory, Ser. B.

[135]  Gyula Y. Katona Toughness and edge-toughness , 1997, Discret. Math..

[136]  A. Morgana,et al.  The Complexity of Toughness in Regular Graphs , 1998 .

[137]  N. Biggs THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[138]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[139]  Andries E. Brouwer Toughness and spectrum of a graph , 1995 .

[140]  Wayne Goddard The toughness of cubic graphs , 1996, Graphs Comb..