The toughness of cubic graphs

DOI10.1007/BF01858441zbMath0846.05049OpenAlexW1984738680MaRDI QIDQ1911237

Wayne Goddard

Publication date: 29 September 1996

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01858441

zbMATH Keywords

independence numbercubic graphstoughnesscycle permutation graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On the Toughness of Cycle Permutation Graphs ⋮ Toughness in graphs -- a survey

Cites Work

• Brooks' graph-coloring theorem and the independence number
• Tough graphs and Hamiltonian circuits.
• Hamiltonian results inK1,3-free graphs
• On the Toughness of a Graph
• Some Ramsey-Type Numbers and the Independence Ratio
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The toughness of cubic graphs