scientific article; zbMATH DE number 2230266

zbMath1075.05559MaRDI QIDQ5708558

Edward F. Schmeichel, Douglas Bauer, Hajo J. Broersma

Publication date: 18 November 2005

Full work available at URL: http://www.sciencedirect.com/science/journal/15710653

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items

An improved degree based condition for Hamiltonian cycles ⋮ Toughness in graphs -- a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Long cycles in graphs with large degree sums
• An upper bound on the shortness exponent of 1-tough, maximal planar graphs
• Recognizing tough graphs is NP-hard
• Finding Hamiltonian circuits in interval graphs
• On submodular function minimization
• Toughness and the existence of k-factors. II
• A 1-tough nonhamiltonian maximal planar graph
• Geometric algorithms and combinatorial optimization
• Connectivity, genus, and the number of components in vertex-deleted subgraphs
• \((2,k)\)-factor-critical graphs and toughness
• Maximum and minimum toughness of graphs of small genus
• Toughness and edge-toughness
• 1-tough cocomparability graphs are hamiltonian
• The complexity of recognizing tough cubic graphs
• Toughness and the existence of \(k\)-factors. III
• The toughness of split graphs
• Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion
• Properties of edge-tough graphs
• Toughness, hamiltonicity and split graphs
• On the shortness exponent of 1-tough, maximal planar graphs
• \((3, k)\)-factor-critical graphs and toughness
• Not every 2-tough graph is Hamiltonian
• Chordality and 2-factors in tough graphs
• A note on Hamiltonian circuits
• Tough graphs and Hamiltonian circuits.
• Shortness exponents of families of graphs
• On k-factor-critical graphs
• Hamiltonian results inK1,3-free graphs
• Toughness and the existence ofk-factors
• Long Cycles in Digraphs
• On Maximal Circuits in Finite Graphs
• Graph Classes: A Survey
• Various results on the toughness of graphs
• Toughness, minimum degree, and the existence of 2‐factors
• Toughness, minimum degree, and the existence of 2‐factors
• Toughness, minimum degree, and spanning cubic subgraphs
• More than one tough chordal planar graphs are Hamiltonian
• Toughness, trees, and walks
• A theorem on tait colorings with an application to the generalized Petersen graphs