189 citations · 506 across the 54 of their papers we have counts for
7 papers · 1 filter
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 maximum number of connected sets in regular graphs
Stijn Cambie, Jan Goedgebeur, Jorik Jooken
We improve the best known lower bounds on the exponential behavior of the maximum of the number of connected sets, , and dominating connected sets, , for regular…
Online Dispatching and Routing for Automated Guided Vehicles in Pickup and Delivery Systems on Loop-Based Graphs
Louis Stubbe, Jens Goemaere, Jan Goedgebeur
Automated guided vehicles (AGVs) are widely used in various industries, and scheduling and routing them in a conflict-free manner is crucial to their efficient operation. We propos…
Critical -Free Graphs
Wen Xia, Jorik Jooken, Jan Goedgebeur +1
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to nor . Let be the path on vertices. A dart is the…
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…