On the Toughness of a Graph
From MaRDI portal
Recommendations
Cites work
- A 1-tough nonhamiltonian maximal planar graph
- Hamiltonian results inK1,3-free graphs
- The binding number of a graph and its Anderson number
- Tough graphs and Hamiltonian circuits.
- Toughness and the existence of k-factors. II
- Toughness and the existence ofk-factors
- Which rational numbers are binding numbers?
Cited in
(40)- Edge-connectivity and edge-disjoint spanning trees
- A large class of maximally tough graphs
- A note on the edge-toughness of a class of graphs
- A survey of integrity
- Bounds on the size of graphs of given order and \(l\)-connectivity
- Maximum and minimum toughness of graphs of small genus
- The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1
- The toughness of cubic graphs
- Toughness and nonhamiltonicity of polyhedral graphs
- Properties of minimally \(t\)-tough graphs
- Toughness and binding number
- Toughness in graphs -- a survey
- Graph toughness from Laplacian eigenvalues
- Toughness of Kronecker product of graphs.
- Toughness of the corona of two graphs
- Results on toughness in graphs under heavy subgraph conditions
- On the toughness of graphs
- Toughness of infinite graphs.
- Equi-toughness partitions of graphs
- Various results on the toughness of graphs
- scientific article; zbMATH DE number 554161 (Why is no real title available?)
- scientific article; zbMATH DE number 653234 (Why is no real title available?)
- scientific article; zbMATH DE number 1156624 (Why is no real title available?)
- scientific article; zbMATH DE number 1934400 (Why is no real title available?)
- The neighbour-integrity of total graphs
- scientific article; zbMATH DE number 5522 (Why is no real title available?)
- scientific article; zbMATH DE number 1885936 (Why is no real title available?)
- The neighbour-integrity of boolean graphs and its compounds
- On the neighbour-integrity of sequential joined graphs
- scientific article; zbMATH DE number 2188362 (Why is no real title available?)
- scientific article; zbMATH DE number 2188363 (Why is no real title available?)
- The tough sets for the generalized Petersen graphs G(n,2)
- On the pancyclicity of 1-tough graphs
- The fully weighted toughness of a graph
- Binding number, \(k\)-factor and spectral radius of graphs
- Toughness of directed graphs
- On the toughness of regular graphs and prisms
- Extremal results for graphs with binding number strictly less than 1/r
- Toughness and prism-Hamiltonicity of \(P_4\)-free graphs
- Toughness and Hamiltonicity in k-trees
This page was built for publication: On the Toughness of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3490022)
