Tough graphs and hamiltonian circuits

1973/07/01 by V. Chvátal, Vašek Chvátal · 29 citations
Mathematics · Computer Science · Engineering · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #graph theory and CDMA systems

paper · doi:10.1016/0012-365x(73)90138-6

Citations

• Congruent Graphs and the Connectivity of Graphs

Cited by

• Hamiltonian degree conditions for tough graphs
• Long cycles in graphs with prescribed toughness and minimum degree
• A Closure Lemma for tough graphs and Hamiltonian degree conditions
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
• Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness
• Hamiltonian cycles in tough (P₂∪ P₃)-free graphs
• Bipartite partition-connected factors with small degrees
• Graph Invariants and Large Cycles - a Catalog of Pure Links
• Toughness and prism-hamiltonicity of P₄-free graphs
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Characterizing the Robustness of Complex Networks
• Set Matrices and The Path/Cycle Problem
• An update on non-Hamiltonian (5)/(4)-tough maximal planar graphs
• On the n-dominating graph of specific graphs
• Hamiltonicity of 3-tough (K₂ ∪ 3K₁)-free graphs
• A Survey of Best Monotone Degree Conditions for Graph Properties
• Linear time determination of the scattering number for strictly chordal\n graphs
• On a new graph defined on the order of elements of a finite group
• Hamiltonian prisms on 5-chordal graphs
• Spanning trails with maximum degree at most 4 in 2K₂-free graphs
• Hamiltonian cycles in 3-tough 2K₂-free graphs
• The inverse inertia problem for graphs
• Long paths and toughness of k-trees and chordal planar graphs
• Robustness of Regular Graphs Based on Natural Connectivity
• Toughness and Hamiltonicity in Random Apollonian Networks
• Component (graph theory) [wikipedia]
• Classes of tree-based networks. [europepmc]
• Design and Reliability Analysis of a Novel Redundancy Topology Architecture. [europepmc]
• Some sufficient conditions on hamilton graphs with toughness. [europepmc]