JJ
Jorik Jooken
math.COcs.DMcs.AIcs.DSmath.OCcs.CCcs.NE
On Valency
published · living versionsW_wez6wkva·v1 · currentpublished
Preprints & journals
38 papers in the corpus · 2019–2026Counterexamples to the Albertson-Berman conjecture: minimum order, connectivity and an improved ratio bound2608.23260v1 · Wouter Cames van Batenburg, Jan Goedgebeur, Jorik Jooken2026 · 1 citationarXiv
Disproving the Petersen Coloring Conjecture: Theoretical Analysis and an Infinite Family of Counterexamples2608.10028v4 · Jan Goedgebeur, Jorik Jooken, Edita M'acajov'a et al.2026 · 0 citationsarXiv
On the number of perfect matchings in planar graphs2606.22253v1 · Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede et al.2026 · 0 citationsarXiv
Counting Hamiltonian paths between prescribed vertices in traceable graphs with a forbidden induced subgraph2606.02279v1 · Jorik Jooken, Carol T. Zamfirescu2026 · 0 citationsarXiv
Vertex-critical -free and -free graphs2605.28537v1 · Jorik Jooken2026 · 0 citationsarXiv
A non-existence result for vertex-girth-regular graphs2604.21486v1 · Jorik Jooken, Denys Lohvynov2026 · 0 citationsarXiv
Three-coloring triangle-free graphs without long forbidden paths2512.12349v2 · Yidong Zhou, Jorik Jooken, Baoyuan Shan et al.2025 · 0 citationsarXiv
Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification2512.09859v2 · Tala Eagling-Vose, Jorik Jooken, Felicia Lucke et al.2025 · 0 citationsarXiv
On the order-diameter ratio of girth-diameter cages2511.21144v3 · Stijn Cambie, Jan Goedgebeur, Jorik Jooken et al.2025 · 0 citationsDiscrete Mathematics & Theoretical Computer Science, vol. 28:4, SOFSEM 2026, Special issues (October 5, 2026) dmtcs:17595
New small regular graphs of given girth: the cage problem and beyond2511.07247v2 · Geoffrey Exoo, Jan Goedgebeur, Jorik Jooken et al.2025 · 0 citationsarXiv
On the extrema of the mean subtree order of graphs2508.20593v2 · Stijn Cambie, Jorik Jooken, Stephan Wagner2025 · 0 citationsarXiv
Computer-assisted graph theory: a survey2508.20825v1 · Jorik Jooken2025 · 0 citationsarXiv
Improved lower bounds on the maximum size of graphs with girth 52508.05562v2 · Jan Goedgebeur, Jorik Jooken, Gwenael Joret et al.2025 · 1 citationarXiv
Counting Small Cycle Double Covers2506.10604v1 · Jorik Jooken, Ben Seamone, Carol T. Zamfirescu2025 · 0 citationsarXiv
On a conjecture of Faudree and Schelp2506.09667v1 · Jan Goedgebeur, Jorik Jooken, Michiel Provoost et al.2025 · 0 citationsarXiv
There are finitely many -vertex-critical -free graphs2504.14134v1 · Yiao Ju, Jorik Jooken, Jan Goedgebeur et al.2025 · 0 citationsarXiv
The Gray graph is pseudo 2-factor isomorphic2504.12095v2 · Marien Abreu, Jan Goedgebeur, Jorik Jooken et al.2025 · 0 citationsarXiv
Sharp results for the Erdős, Pach, Pollack and Tuza problem2502.08626v1 · Stijn Cambie, Jorik Jooken2025 · 0 citationsarXivon Valency
Critical -Free Graphs2501.04923v1 · Wen Xia, Jorik Jooken, Jan Goedgebeur et al.2025 · 0 citationsarXiv
On -Graphs without -Cycles2411.19023v2 · Leonard Chidiebere Eze, Robert Jajcay, Jorik Jooken2024 · 0 citationsarXiv
Computational methods for finding bi-regular cages2411.17351v1 · Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede2024 · 1 citationarXiv
On the girth and connectivity of cubic graphs with a unique longest cycle2409.17205v2 · Jorik Jooken, Carol T. Zamfirescu2024 · 0 citationsarXiv
On graphs isomorphic with their conduction graph2409.13518v1 · Aidan Birkinshaw, Patrick W. Fowler, Jan Goedgebeur et al.2024 · 1 citationarXiv
On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration2408.14557v1 · Robert Jajcay, Jorik Jooken, Istv'an Porups'anszki2024 · 1 citationarXiv
Minimal obstructions to -coloring in hereditary graph classes2404.11704v2 · Jan Goedgebeur, Jorik Jooken, Karolina Okrasa et al.2024 · 0 citationsarXiv
Some Results on Critical ()-free Graphs2403.05611v1 · Wen Xia, Jorik Jooken, Jan Goedgebeur et al.2024 · 2 citationsarXiv
Exhaustive generation of edge-girth-regular graphs2401.08271v2 · Jan Goedgebeur, Jorik Jooken2024 · 4 citationsarXiv
A note on -coloring and -coloring 4-regular graphs2401.05510v1 · Jorik Jooken2024 · 0 citationsarXiv
Counterexamples to conjectures on the occupancy fraction of graphs2311.05542v2 · Stijn Cambie, Jorik Jooken2023 · 1 citationarXiv
The maximum number of connected sets in regular graphs2311.00075v2 · Stijn Cambie, Jan Goedgebeur, Jorik Jooken2023 · 1 citationarXiv
Improved asymptotic upper bounds for the minimum number of pairwise distinct longest cycles in regular graphs2310.17469v1 · Jorik Jooken2023 · 0 citationsarXiv
Critical -Free Graphs2308.03414v3 · Wen Xia, Jorik Jooken, Jan Goedgebeur et al.2023 · 8 citationsarXiv
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions2211.09665v1 · Jorik Jooken, Pieter Leyman, Patrick De Causmaecker2022 · 10 citationsarXiv
Few hamiltonian cycles in graphs with one or two vertex degrees2211.08105v1 · Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo et al.2022 · 4 citationsarXiv
A heuristic algorithm using tree decompositions for the maximum happy vertices problem2208.14921v2 · Louis Carpentier, Jorik Jooken, Jan Goedgebeur2022 · 2 citationsarXiv
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems2010.11523v3 · Jorik Jooken, Pieter Leyman, Tony Wauters et al.2020 · 20 citationsarXiv
Evolving test instances of the Hamiltonian completion problem2011.02291v3 · Thibault Lechien, Jorik Jooken, Patrick De Causmaecker2020 · 6 citationsarXiv
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs1904.11337v4 · Jorik Jooken, Pieter Leyman, Patrick De Causmaecker2019 · 5 citationsarXiv
Career total: 53 works. 38 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.