Minimally tough chordal graphs with toughness at most 1/2. - Gyula Y. Katona; Humara Khan (CoRR, 2022)

An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth. - Gyula Y. Katona; Humara Khan (Graphs Comb., 2024)