The fully weighted toughness of a graph

DOI10.1016/j.dam.2023.10.008zbMath1530.05073OpenAlexW4388029883MaRDI QIDQ6180647

Wayne Goddard, Julia VanLandingham

Publication date: 2 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.10.008

zbMATH Keywords

weighttoughnessgraph vulnerability

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Communication complexity, information complexity (68Q11)

Cites Work

• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• The complexity of recognizing minimally tough graphs
• Hamiltonian results inK1,3-free graphs
• On the Toughness of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The fully weighted toughness of a graph