The following pages link to Toughness in graphs -- a survey (Q2494126):
Displaying 50 items.
- 10-tough chordal graphs are Hamiltonian (extended abstract) (Q322253) (← links)
- Forbidden subgraphs for Hamiltonicity of 1-tough graphs (Q339484) (← links)
- 10-tough chordal graphs are Hamiltonian (Q345090) (← links)
- The spectrum and toughness of regular graphs (Q403562) (← links)
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees (Q433082) (← links)
- A toughness condition for a spanning tree with bounded total excesses (Q497366) (← links)
- Spanning trees: A survey (Q659663) (← links)
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← links)
- Relationship among triangulations, quadrangulations and optimal 1-planar graphs (Q897254) (← links)
- A clique-covering sufficient condition for hamiltonicity of graphs (Q990948) (← links)
- Bipartite toughness and \(k\)-factors in bipartite graphs (Q1008540) (← links)
- Long paths and toughness of \(k\)-trees and chordal planar graphs (Q1618219) (← links)
- Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs (Q1684926) (← links)
- An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs (Q1690216) (← links)
- A kind of conditional connectivity of Cayley graphs generated by wheel graphs (Q1735259) (← links)
- Vulnerability of subclasses of chordal graphs (Q1742199) (← links)
- The toughness of Kneser graphs (Q2037560) (← links)
- Toughness, forbidden subgraphs and pancyclicity (Q2045380) (← links)
- Toughness, forbidden subgraphs, and Hamilton-connected graphs (Q2062680) (← links)
- An Ore-type condition for Hamiltonicity in tough graphs (Q2073293) (← links)
- \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs (Q2091163) (← links)
- Toughness and normalized Laplacian eigenvalues of graphs (Q2139788) (← links)
- The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
- Separation of Cartesian products of graphs into several connected components by the removal of vertices (Q2151221) (← links)
- Toughness in pseudo-random graphs (Q2225447) (← links)
- Hamiltonian cycles in tough \((P_2\cup P_3)\)-free graphs (Q2227834) (← links)
- On connectivity of the facet graphs of simplicial complexes (Q2279942) (← links)
- Implementation of RTO in a large hydrogen network considering uncertainty (Q2302370) (← links)
- Toughness, binding number and restricted matching extension in a graph (Q2401801) (← links)
- Vulnerability of nearest neighbor graphs (Q2449104) (← links)
- Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph (Q2657863) (← links)
- A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs (Q2675842) (← links)
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey (Q2695475) (← links)
- Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
- Toughness, Hamiltonicity and spectral radius in graphs (Q2701002) (← links)
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824) (← links)
- Toughness of the corona of two graphs (Q2885501) (← links)
- A survey of some network reliability analysis and synthesis results (Q3057110) (← links)
- BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS (Q3560059) (← links)
- Forbidden Induced Subgraphs for Toughness (Q4920659) (← links)
- Graph connectivity and binomial edge ideals (Q5298175) (← links)
- On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>‐Free Graphs (Q5417820) (← links)
- Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs (Q6046653) (← links)
- Cycle lengths in randomly perturbed graphs (Q6063344) (← links)
- Toughness and Hamiltonicity of strictly chordal graphs (Q6070991) (← links)
- Forbidden subgraphs and 2‐factors in 3/2‐tough graphs (Q6074577) (← links)
- ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs (Q6081885) (← links)
- Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs (Q6177437) (← links)
- The fully weighted toughness of a graph (Q6180647) (← links)
- Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs (Q6184533) (← links)
