Toughness in graphs -- a survey (Q2494126): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00373-006-0649-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2001161770
@@ Property / OpenAlex ID: W2001161770 / rank @@
+Normal rank
@@ Property / cites work @@
+Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
+Normal rank
@@ Property / cites work @@
+Tough Ramsey graphs without short cycles
@@ Property / cites work: Tough Ramsey graphs without short cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q3781786
@@ Property / cites work: Q3781786 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3789603
@@ Property / cites work: Q3789603 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, minimum degree, and the existence of 2‐factors
+Normal rank
@@ Property / cites work @@
+Long cycles in graphs with prescribed toughness and minimum degree
+Normal rank
@@ Property / cites work @@
+Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
+Normal rank
@@ Property / cites work @@
+A generalization of a result of Häggkvist and Nicoghossian
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
+Normal rank
@@ Property / cites work @@
+Q5708558
@@ Property / cites work: Q5708558 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3971997
@@ Property / cites work: Q3971997 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4856626
@@ Property / cites work: Q4856626 / rank @@
+Normal rank
@@ Property / cites work @@
+Not every 2-tough graph is Hamiltonian
@@ Property / cites work: Not every 2-tough graph is Hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian properties of graphs with large neighborhood unions
+Normal rank
@@ Property / cites work @@
+Recognizing tough graphs is NP-hard
@@ Property / cites work: Recognizing tough graphs is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of recognizing tough cubic graphs
@@ Property / cites work: The complexity of recognizing tough cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4489197
@@ Property / cites work: Q4489197 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and triangle-free graphs
@@ Property / cites work: Toughness and triangle-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+-factors in triangle-free graphs
@@ Property / cites work: 2-factors in triangle-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3984510
@@ Property / cites work: Q3984510 / rank @@
+Normal rank
@@ Property / cites work @@
+Chordality and 2-factors in tough graphs
@@ Property / cites work: Chordality and 2-factors in tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A simple proof of a theorem of Jung
@@ Property / cites work: A simple proof of a theorem of Jung / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of recognizing tough graphs
@@ Property / cites work: On the complexity of recognizing tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Long cycles in graphs with large degree sums
@@ Property / cites work: Long cycles in graphs with large degree sums / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, minimum degree, and spanning cubic subgraphs
+Normal rank
@@ Property / cites work @@
+Q4873795
@@ Property / cites work: Q4873795 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3976600
@@ Property / cites work: Q3976600 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, minimum degree, and the existence of 2‐factors
+Normal rank
@@ Property / cites work @@
+A note on dominating cycles in 2-connected graphs
@@ Property / cites work: A note on dominating cycles in 2-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4871126
@@ Property / cites work: Q4871126 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4405806
@@ Property / cites work: Q4405806 / rank @@
+Normal rank
@@ Property / cites work @@
+TWO THEOREMS IN GRAPH THEORY
@@ Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+Q4094891
@@ Property / cites work: Q4094891 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3866156
@@ Property / cites work: Q3866156 / rank @@
+Normal rank
@@ Property / cites work @@
+The edge Hamiltonian path problem is NP-complete
@@ Property / cites work: The edge Hamiltonian path problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
+Normal rank
@@ Property / cites work @@
+Toughness and longest cycles in 2-connected planar graphs
+Normal rank
@@ Property / cites work @@
+More than one tough chordal planar graphs are Hamiltonian
+Normal rank
@@ Property / cites work @@
+Large cycles in graphs
@@ Property / cites work: Large cycles in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Pancyclic graphs. I
@@ Property / cites work: Pancyclic graphs. I / rank @@
+Normal rank
@@ Property / cites work @@
+Longest Cycles in 3-Connected 3-Regular Graphs
@@ Property / cites work: Longest Cycles in 3-Connected 3-Regular Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5688996
@@ Property / cites work: Q5688996 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangle-free graphs whose independence number equals the degree
+Normal rank
@@ Property / cites work @@
+Weakly pancyclic graphs
@@ Property / cites work: Weakly pancyclic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Degree sums for edges and cycle lengths in graphs
@@ Property / cites work: Degree sums for edges and cycle lengths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Various results on the toughness of graphs
@@ Property / cites work: Various results on the toughness of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Long paths and cycles in tough graphs
@@ Property / cites work: Long paths and cycles in tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Long cycles, degree sums and neighborhood unions
@@ Property / cites work: Long cycles, degree sums and neighborhood unions / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and Hamiltonicity in \(k\)-trees
@@ Property / cites work: Toughness and Hamiltonicity in \(k\)-trees / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and spectrum of a graph
@@ Property / cites work: Toughness and spectrum of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+\((2,k)\)-factor-critical graphs and toughness
@@ Property / cites work: \((2,k)\)-factor-critical graphs and toughness / rank @@
+Normal rank
@@ Property / cites work @@
+Q4350166
@@ Property / cites work: Q4350166 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4032983
@@ Property / cites work: Q4032983 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness of graphs and \([2,b]\)-factors
@@ Property / cites work: Toughness of graphs and \([2,b]\)-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Q4378526
@@ Property / cites work: Q4378526 / rank @@
+Normal rank
@@ Property / cites work @@
+Long cycles in 3-connected graphs
@@ Property / cites work: Long cycles in 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Hamilton's ideals
@@ Property / cites work: On Hamilton's ideals / rank @@
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Hamiltonian circuits
@@ Property / cites work: A note on Hamiltonian circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684150
@@ Property / cites work: Q3684150 / rank @@
+Normal rank
@@ Property / cites work @@
+On submodular function minimization
@@ Property / cites work: On submodular function minimization / rank @@
+Normal rank
@@ Property / cites work @@
+On Path-Tough Graphs
@@ Property / cites work: On Path-Tough Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+-tough cocomparability graphs are hamiltonian
@@ Property / cites work: 1-tough cocomparability graphs are hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound on the shortness exponent of 1-tough, maximal planar graphs
+Normal rank
@@ Property / cites work @@
+On the toughness index of planar graphs
@@ Property / cites work: On the toughness index of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A large class of maximally tough graphs
@@ Property / cites work: A large class of maximally tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Connected (g, f)-factors
@@ Property / cites work: Connected (g, f)-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, trees, and walks
@@ Property / cites work: Toughness, trees, and walks / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and the existence of k-factors. II
@@ Property / cites work: Toughness and the existence of k-factors. II / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and the existence of \(k\)-factors. III
@@ Property / cites work: Toughness and the existence of \(k\)-factors. III / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and the existence of \(k\)-factors. IV
@@ Property / cites work: Toughness and the existence of \(k\)-factors. IV / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and the existence ofk-factors
@@ Property / cites work: Toughness and the existence ofk-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Theory and Probability
@@ Property / cites work: Graph Theory and Probability / rank @@
+Normal rank
@@ Property / cites work @@
+New sufficient conditions for cycles in graphs
@@ Property / cites work: New sufficient conditions for cycles in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4014317
@@ Property / cites work: Q4014317 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, degrees and 2-factors
@@ Property / cites work: Toughness, degrees and 2-factors / rank @@
+Normal rank
@@ Property / cites work @@
+On k-factor-critical graphs
@@ Property / cites work: On k-factor-critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288154
@@ Property / cites work: Q4288154 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5466048
@@ Property / cites work: Q5466048 / rank @@
+Normal rank
@@ Property / cites work @@
+The square of every two-connected graph is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and Hamiltonicity of a class of planar graphs
+Normal rank
@@ Property / cites work @@
+Measures of vulnerability–the integrity family
@@ Property / cites work: Measures of vulnerability–the integrity family / rank @@
+Normal rank
@@ Property / cites work @@
+The toughness of cubic graphs
@@ Property / cites work: The toughness of cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum and minimum toughness of graphs of small genus
+Normal rank
@@ Property / cites work @@
+On the Toughness of a Graph
@@ Property / cites work: On the Toughness of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4873831
@@ Property / cites work: Q4873831 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Shortness exponents of families of graphs
@@ Property / cites work: Shortness exponents of families of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Non-Hamiltonian Graphs I
@@ Property / cites work: On the Structure of Non-Hamiltonian Graphs I / rank @@
+Normal rank
@@ Property / cites work @@
+A remark on Hamiltonian cycles
@@ Property / cites work: A remark on Hamiltonian cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and nonhamiltonicity of polyhedral graphs
+Normal rank
@@ Property / cites work @@
+Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs
+Normal rank
@@ Property / cites work @@
+A sharp lower bound for the circumference of 1‐tough graphs with large degree sums
+Normal rank
@@ Property / cites work @@
+A Remark on Hamiltonian Cycles
@@ Property / cites work: A Remark on Hamiltonian Cycles / rank @@
+Normal rank
@@ Property / cites work @@
+On the length of longest dominating cycles in graphs
+Normal rank
@@ Property / cites work @@
+Long cycles and neighborhood union in 1-tough graphs with large degree sums
+Normal rank
@@ Property / cites work @@
+Hamiltonian degree conditions for tough graphs
@@ Property / cites work: Hamiltonian degree conditions for tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4326197
@@ Property / cites work: Q4326197 / rank @@
+Normal rank
@@ Property / cites work @@
+Longest cycles in 3-connected planar graphs
@@ Property / cites work: Longest cycles in 3-connected planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Maximal Circuits in Finite Graphs
@@ Property / cites work: On Maximal Circuits in Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3356326
@@ Property / cites work: Q3356326 / rank @@
+Normal rank
@@ Property / cites work @@
+Longest cycles in tough graphs
@@ Property / cites work: Longest cycles in tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness of graphs and the existence of factors
@@ Property / cites work: Toughness of graphs and the existence of factors / rank @@
+Normal rank
@@ Property / cites work @@
+Two sufficient conditions for a 2-factor in a bipartite graph
+Normal rank
@@ Property / cites work @@
+Toughness and edge-toughness
@@ Property / cites work: Toughness and edge-toughness / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of edge-tough graphs
@@ Property / cites work: Properties of edge-tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Paths and Circuits in Critical Graphs
@@ Property / cites work: Paths and Circuits in Critical Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian circuits in interval graphs
@@ Property / cites work: Finding Hamiltonian circuits in interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, hamiltonicity and split graphs
@@ Property / cites work: Toughness, hamiltonicity and split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4873754
@@ Property / cites work: Q4873754 / rank @@
+Normal rank
@@ Property / cites work @@
+Circumferences in 1-tough graphs
@@ Property / cites work: Circumferences in 1-tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2715952
@@ Property / cites work: Q2715952 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for the circumference of a graph
@@ Property / cites work: A lower bound for the circumference of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4949854
@@ Property / cites work: Q4949854 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Ramanujan graphs
@@ Property / cites work: Ramanujan graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
+Normal rank
@@ Property / cites work @@
+Hamiltonian results inK1,3-free graphs
@@ Property / cites work: Hamiltonian results inK1,3-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Hamiltonian bipartite graphs
@@ Property / cites work: On Hamiltonian bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sur le coloriage des graphs
@@ Property / cites work: Sur le coloriage des graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5591387
@@ Property / cites work: Q5591387 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5628163
@@ Property / cites work: Q5628163 / rank @@
+Normal rank
@@ Property / cites work @@
+A 1-tough nonhamiltonian maximal planar graph
@@ Property / cites work: A 1-tough nonhamiltonian maximal planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q4518404
@@ Property / cites work: Q4518404 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4711931
@@ Property / cites work: Q4711931 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and matching extension in graphs
@@ Property / cites work: Toughness and matching extension in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4390654
@@ Property / cites work: Q4390654 / rank @@
+Normal rank
@@ Property / cites work @@
+On a closure concept in claw-free graphs
@@ Property / cites work: On a closure concept in claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity, genus, and the number of components in vertex-deleted subgraphs
+Normal rank
@@ Property / cites work @@
+\((3, k)\)-factor-critical graphs and toughness
@@ Property / cites work: \((3, k)\)-factor-critical graphs and toughness / rank @@
+Normal rank
@@ Property / cites work @@
+Q3724373
@@ Property / cites work: Q3724373 / rank @@
+Normal rank
@@ Property / cites work @@
+Long Cycles in Digraphs
@@ Property / cites work: Long Cycles in Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Reflections on graph theory
@@ Property / cites work: Reflections on graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+On the shortness exponent of 1-tough, maximal planar graphs
+Normal rank
@@ Property / cites work @@
+A Theorem on Planar Graphs
@@ Property / cites work: A Theorem on Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Existence of dominating cycles and paths
@@ Property / cites work: Existence of dominating cycles and paths / rank @@
+Normal rank
@@ Property / cites work @@
+A theorem on tait colorings with an application to the generalized Petersen graphs
+Normal rank
@@ Property / cites work @@
+A generalization of a result of Bauer and Schmeichel
+Normal rank
@@ Property / cites work @@
+On a connection between the existence of k-trees and the toughness of a graph
+Normal rank
@@ Property / cites work @@
+The toughness of split graphs
@@ Property / cites work: The toughness of split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The binding number of a graph and its Anderson number
+Normal rank
@@ Property / cites work @@
+On hamiltonian line graphs and connectivity
@@ Property / cites work: On hamiltonian line graphs and connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Q5790850
@@ Property / cites work: Q5790850 / rank @@
+Normal rank