189 citations · 506 across the 54 of their papers we have counts for
70 papers
Counterexamples to the Albertson-Berman conjecture: minimum order, connectivity and an improved ratio bound
Wouter Cames van Batenburg, Jan Goedgebeur, Jorik Jooken
In 1979, Albertson and Berman conjectured that every planar graph contains an induced forest of order at least . This long-standing conjecture was recently disproved…
On the number of perfect matchings in planar graphs
Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede +1
We investigate the minimum non-zero number of perfect matchings in planar graphs. We prove that this is a constant for 2-connected planar graphs of minimum degree 3 and 3-connected…
Knowledge management in House of Graphs
Gauvain Devillez, Sven D'hondt, Jan Goedgebeur
The House of Graphs is an online database of graphs which can be accessed at https://houseofgraphs.org/. It serves as a central repository for complete lists of graphs for various…
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)…