Humara Khan

most citedMinimally tough chordal graphs with toughness at most

1/2

6 citations · 6 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2025

Minimally tough series-parallel graphs with toughness at least $1/2$

Gyula Y. Katona, Humara Khan

Let $t$ be a positive real number. A graph is called \emph{ $t$ -tough} if the removal of any vertex set $S$ that disconnects the graph leaves at most $∣ S ∣/ t$ components. The toughne…

math.CO2022★ 6 cited

Minimally tough chordal graphs with toughness at most $1/2$

Gyula Y. Katona, Humara Khan

Let $t$ be a positive real number. A graph is called \emph{ $t$ -tough} if the removal of any vertex set $S$ that disconnects the graph leaves at most $∣ S ∣/ t$ components. The toughne…

Minimally tough series-parallel graphs with toughness at least 1/2

Minimally tough chordal graphs with toughness at most 1/2

Minimally tough series-parallel graphs with toughness at least $1/2$

Minimally tough chordal graphs with toughness at most $1/2$