10 citations · 11 across the 6 of their papers we have counts for
Showing 2022Show all
3 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 , no chordal graph is minimally -tough, while Katona and Khan characterized all minimally -tough, chordal…
math.CO2022
On (almost) --homogeneous distance-biregular graphs
Blas Fernandez, Safet Penjic
Let denote a bipartite graph with vertex set , color partitions , , and assume that every vertex in has eccentricity . For and a non-negative int…
math.CO2022★ 1 cited
On some problems regarding distance-balanced graphs
Blas Fernandez, Ademir Hujdurovic
A graph is said to be distance-balanced if for any edge of , the number of vertices closer to than to is equal to the number of vertices closer to than to $…