18 citations · 31 across the 33 of their papers we have counts for
13 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…
Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
Tala Eagling-Vose, Jorik Jooken, Felicia Lucke +2
We consider Colouring on graphs that are -subgraph-free for some fixed graph , which are graphs that do not contain as a subgraph. To classify the complexity of Colouring…
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)…
Computer-assisted graph theory: a survey
Jorik Jooken
Computers and algorithms play an ever-increasing role in obtaining new results in graph theory. In this survey, we present a broad range of techniques used in computer-assisted gra…
On the extrema of the mean subtree order of graphs
Stijn Cambie, Jorik Jooken, Stephan Wagner
It has been conjectured that the minimum and maximum of the mean subtree order among connected graphs of order are attained by the path and clique , respectively. Ex…
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…
Counting Small Cycle Double Covers
Jorik Jooken, Ben Seamone, Carol T. Zamfirescu
A theorem due to Seyffarth states that every planar -connected -vertex graph has a cycle double cover (CDC) containing at most cycles (a "small" CDC). We extend this th…
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 $\{…
The Gray graph is pseudo 2-factor isomorphic
Marien Abreu, Jan Goedgebeur, Jorik Jooken +2
A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that…
Sharp results for the Erdős, Pach, Pollack and Tuza problem
Stijn Cambie, Jorik Jooken
We consider the Erdős, Pach, Pollack and Tuza problem, asking for the maximum diameter of a graph with given order , minimum degree and clique number at most . We solve t…
Critical -Free Graphs
Wen Xia, Jorik Jooken, Jan Goedgebeur +3
A graph is -vertex-critical if but for all . A graph is -free if it contains no induced subgraph isomorphic to nor .…