5 citations · 5 across the 8 of their papers we have counts for
10 papers
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 , i.e. the minimum num…
Infinite families of planar graphs of a given injective chromatic number
Matias Daneels, Jan Goedgebeur, Jarne Renders
An injective colouring of a graph is a colouring in which every two vertices sharing a common neighbour receive a different colour. Chen, Hahn, Raspaud and Wang conjectured that ev…
Generation of Cycle Permutation Graphs and Permutation Snarks
Jan Goedgebeur, Jarne Renders, Steven Van Overberghe
We present an algorithm for the efficient generation of all pairwise non-isomorphic cycle permutation graphs, i.e. cubic graphs with a -factor consisting of two chordless cycles…
On the existence of factors intersecting sets of cycles in regular graphs
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo +3
A recent result by Kardoš, Máčajová and Zerafa [J. Comb. Theory, Ser. B. 160 (2023) 1--14] related to the famous Berge-Fulkerson conjecture implies that given an arbitrary set of o…
Cubic graphs with edges in exactly one perfect matching
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo +2
Petersen's seminal work in 1891 asserts that the edge-set of a cubic graph can be covered by distinct perfect matchings if and only if it is bridgeless. Actually, it is known that…
HIST-Critical Graphs and Malkevitch's Conjecture
Jan Goedgebeur, Kenta Noguchi, Jarne Renders +1
In a given graph, a HIST is a spanning tree without -valent vertices. Motivated by developing a better understanding of HIST-free graphs, i.e. graphs containing no HIST, in this…
Generation and New Infinite Families of -hypohamiltonian Graphs
Jan Goedgebeur, Jarne Renders, Carol T. Zamfirescu
We present an algorithm which can generate all pairwise non-isomorphic -hypohamiltonian graphs, i.e. non-hamiltonian graphs in which the removal of any pair of adjacent vertic…
-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 -hamiltonian graphs, that is, graphs in which the removal of any pair of adjacent ver…
The Frank number and nowhere-zero flows on graphs
Jan Goedgebeur, Edita Máčajová, Jarne Renders
An edge of a graph is called deletable for some orientation if the restriction of to is a strong orientation. Inspired by a problem of Frank, in 2021 Hörsch a…
Graphs with Many Hamiltonian Paths
Erik Carlson, Willem Fletcher, MurphyKate Montee +3
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We constr…