Gábor Wiener

most cited

K_{2}

-Hamiltonian Graphs: II

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

collaborators

2 papers

math.CO2025

Network fault costs based on minimum leaf spanning trees

Jan Goedgebeur, Jarne Renders, Gábor Wiener +1

We study the fault-tolerance of networks from both the structural and computational point of view using the minimum leaf number of the corresponding graph $G$ , i.e. the minimum num…

math.CO2023★ 5 cited

$K_{2}$ -Hamiltonian Graphs: II

Jan Goedgebeur, Jarne Renders, Gábor Wiener +1

In this paper we use theoretical and computational tools to continue our investigation of $K_{2}$ -hamiltonian graphs, that is, graphs in which the removal of any pair of adjacent ver…

Network fault costs based on minimum leaf spanning trees

K2​-Hamiltonian Graphs: II

$K_{2}$ -Hamiltonian Graphs: II