On the Toughness of a Graph

DOI10.1080/16073606.1990.9631613zbMath0708.05035OpenAlexW1999446839WikidataQ106065172 ScholiaQ106065172MaRDI QIDQ3490022

Wayne Goddard, Henda C. Swart

Publication date: 1990

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/16073606.1990.9631613

zbMATH Keywords

toughness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (13)

The neighbour-integrity of total graphs ⋮ Toughness of the corona of two graphs ⋮ Maximum and minimum toughness of graphs of small genus ⋮ The toughness of cubic graphs ⋮ The fully weighted toughness of a graph ⋮ Binding number, \(k\)-factor and spectral radius of graphs ⋮ Toughness and binding number ⋮ A survey of integrity ⋮ Toughness in graphs -- a survey ⋮ The neighbour-integrity of boolean graphs and its compounds ⋮ On the neighbour-integrity of sequential joined graphs ⋮ Toughness and prism-Hamiltonicity of \(P_4\)-free graphs ⋮ Bounds on the size of graphs of given order and \(l\)-connectivity

Cites Work

• Toughness and the existence of k-factors. II
• A 1-tough nonhamiltonian maximal planar graph
• Tough graphs and Hamiltonian circuits.
• Hamiltonian results inK1,3-free graphs
• Toughness and the existence ofk-factors
• Which rational numbers are binding numbers?
• The binding number of a graph and its Anderson number

This page was built for publication: On the Toughness of a Graph