Toughness and nonhamiltonicity of polyhedral graphs
From MaRDI portal
Publication:2366022
Recommendations
- Toughness and Hamiltonicity of a class of planar graphs
- scientific article; zbMATH DE number 68618
- Toughness, Hamiltonicity and spectral radius in graphs
- Toughness, hamiltonicity and split graphs
- On the toughness of graphs
- Toughness and triangle-free graphs
- Toughness and Hamiltonicity of strictly chordal graphs
- On the Toughness of a Graph
- scientific article; zbMATH DE number 1536530
- Maximum nonhamiltonian tough graphs
Cites work
- A 1-tough nonhamiltonian maximal planar graph
- A Theorem on Planar Graphs
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs
- scientific article; zbMATH DE number 3451870 (Why is no real title available?)
- scientific article; zbMATH DE number 3292649 (Why is no real title available?)
- Shortness exponents of families of graphs
- Tough graphs and Hamiltonian circuits.
Cited in
(13)- All nonhamiltonian tough graphs satisfying a 3-degree sum and Fan-type conditions
- Maximum and minimum toughness of graphs of small genus
- An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
- Toughness and Hamiltonicity of a class of planar graphs
- Non-hamiltonian 5 4-tough maximal planar graphs
- Toughness, hamiltonicity and split graphs
- On the shortness exponent of 1-tough, maximal planar graphs
- Toughness in graphs -- a survey
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
- scientific article; zbMATH DE number 1934400 (Why is no real title available?)
- scientific article; zbMATH DE number 1536530 (Why is no real title available?)
- Hamiltonicity in multitriangular graphs
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs
This page was built for publication: Toughness and nonhamiltonicity of polyhedral graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366022)