189 citations · 506 across the 54 of their papers we have counts for
9 papers · 1 filter
Three-coloring triangle-free graphs without long forbidden paths
Yidong Zhou, Jorik Jooken, Baoyuan Shan +2
A graph is -vertex-critical if , but for every proper induced subgraph of . For a family of graphs , is -free if no g…
On the order-diameter ratio of girth-diameter cages
Stijn Cambie, Jan Goedgebeur, Jorik Jooken +1
For integers , a -cage (or simply girth-diameter cage) is a smallest -regular graph of girth and diameter (if it exists). The order of a -cage i…
New small regular graphs of given girth: the cage problem and beyond
Geoffrey Exoo, Jan Goedgebeur, Jorik Jooken +2
The cage problem concerns finding -graphs, which are -regular graphs with girth , of the smallest possible number of vertices. The central goal is to determine $n(k,g)…
Improved lower bounds on the maximum size of graphs with girth 5
Jan Goedgebeur, Jorik Jooken, Gwenaël Joret +1
We present a new algorithm for improving lower bounds on , the maximum size (number of edges) of an -vertex graph of girth at least 5. The core of our algorit…
On a conjecture of Faudree and Schelp
Jan Goedgebeur, Jorik Jooken, Michiel Provoost +1
In 1976 Faudree and Schelp conjectured that in a hamiltonian-connected graph on vertices, any two distinct vertices are connected by a path of length for every .…
There are finitely many -vertex-critical -free graphs
Yiao Ju, Jorik Jooken, Jan Goedgebeur +1
In this paper, we are interested in -colouring algorithms for graphs that do not contain an induced path on vertices nor an induced bull, i.e., the graph with vertex set $\{…