G. Katona

activity

20102025

t

-tough graphs

16 citations · 53 across the 13 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

On minimally tough chordal graphs

Clément Dallard, Blas Fernández, Gyula Y. Katona +2

Katona and Varga showed that for any rational number $t \in (1/2, 1]$ , no chordal graph is minimally $t$ -tough, while Katona and Khan characterized all minimally $t$ -tough, chordal…

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…

On minimally tough chordal graphs

Minimally tough chordal graphs with toughness at most 1/2

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