Jan Goedgebeur

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 72

Top Topics

Tree Decompositions

Kullback Leibler

Graph Theoretic

Top Venues

J. Graph Theory

Discret. Appl. Math.

Publications

Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu
-Hamiltonian graphs: II. J. Graph Theory 105 (4) (2024)
Jan Goedgebeur, Kenta Noguchi, Jarne Renders, Carol T. Zamfirescu
HIST-Critical Graphs and Malkevitch's Conjecture. CoRR (2024)
Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt
Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. MFCS (2024)
Louis Carpentier, Jorik Jooken, Jan Goedgebeur
A heuristic algorithm using tree decompositions for the maximum happy vertices problem. J. Heuristics 30 (1-2) (2024)
Jan Goedgebeur, Jarne Renders, Carol T. Zamfirescu
Generation and new infinite families of K2-hypohamiltonian graphs. Discret. Math. 347 (7) (2024)
Jan Goedgebeur, Thomas Gringore, Carol T. Zamfirescu
On non-hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs. Discuss. Math. Graph Theory 44 (4) (2024)
Jan Goedgebeur, Edita Mácajová, Jarne Renders
Frank number and nowhere-zero flows on graphs. CoRR (2023)
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
Some results on k-critical P5-free graphs. Discret. Appl. Math. 334 (2023)
Kris Coolsaet, Sven D'hondt, Jan Goedgebeur
House of Graphs 2.0: A database of interesting graphs and more. Discret. Appl. Math. 325 (2023)
Louis Stubbe, Jens Goemaere, Jan Goedgebeur
Efficient Online Scheduling and Routing for Automated Guided Vehicles: Comparing a Novel Loop-Based Algorithm Against Existing Methods. CoRR (2023)
Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu
-Hamiltonian Graphs: II. CoRR (2023)
Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel
Colouring graphs with no induced six-vertex path or diamond. Theor. Comput. Sci. 941 (2023)
Jan Goedgebeur, Jarne Renders, Carol T. Zamfirescu
-hypohamiltonian Graphs. CoRR (2023)
Jan Goedgebeur, Edita Mácajová, Jarne Renders
On the Frank Number and Nowhere-Zero Flows on Graphs. WG (2023)
Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang
-Free Graphs. COCOA (2) (2023)
Jan Goedgebeur
An introduction to Computational Graph Theory and Generation Algorithms (invited paper). ITAT (2022)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
The minimality of the Georges-Kelmans graph. Math. Comput. 91 (335) (2022)
Jan Goedgebeur, Steven Van Overberghe
New bounds for Ramsey numbers R(Kk-e, Kl-e). Discret. Appl. Math. 307 (2022)
Louis Carpentier, Jorik Jooken, Jan Goedgebeur
A heuristic algorithm for the maximum happy vertices problem using tree decompositions. CoRR (2022)
Kris Coolsaet, Sven D'hondt, Jan Goedgebeur
House of Graphs 2.0: a database of interesting graphs and more. CoRR (2022)
Jan Goedgebeur, Patric R. J. Östergård
Switching 3-edge-colorings of cubic graphs. Discret. Math. 345 (9) (2022)
Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo, Ben Seamone, Carol T. Zamfirescu
Few hamiltonian cycles in graphs with one or two vertex degrees. CoRR (2022)
Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel
Colouring Graphs with No Induced Six-Vertex Path or Diamond. COCOON (2021)
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
A unified approach to construct snarks with circular flow number 5. J. Graph Theory 97 (1) (2021)
Jan Goedgebeur, Steven Van Overberghe
-e). CoRR (2021)
Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci. 850 (2021)
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
-Free Graphs. CoRR (2021)
Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel
Colouring graphs with no induced six-vertex path or diamond. CoRR (2021)
Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi
-free graphs. Theor. Comput. Sci. 864 (2021)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
The Minimality of the Georges-Kelmans Graph. CoRR (2021)
Jan Goedgebeur, Patric R. J. Östergård
Switching 3-edge-colorings of cubic graphs. CoRR (2021)
Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi
-Free Graphs. COCOON (2020)
Patrick W. Fowler, John Baptist Gauci, Jan Goedgebeur, Tomaz Pisanski, Irene Sciriha
Existence of regular nut graphs for degree at most 11. Discuss. Math. Graph Theory 40 (2) (2020)
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
Computational results and new bounds for the circular flow number of snarks. Discret. Math. 343 (10) (2020)
Jan Goedgebeur, Addie Neyt, Carol T. Zamfirescu
Structural and computational results on platypus graphs. Appl. Math. Comput. 386 (2020)
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
The smallest nontrivial snarks of oddness 4. Discret. Appl. Math. 277 (2020)
Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu
Graphs with few hamiltonian cycles. Math. Comput. 89 (322) (2020)
Jan Goedgebeur
On minimal triangle-free 6-chromatic graphs. J. Graph Theory 93 (1) (2020)
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
Obstructions for three-coloring graphs without induced paths on six vertices. J. Comb. Theory, Ser. B 140 (2020)
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs. SIAM J. Discret. Math. 34 (1) (2020)
Geoffrey Exoo, Jan Goedgebeur
Bounds for the smallest k-chromatic graphs of given girth. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener
On the minimum leaf number of cubic graphs. Discret. Math. 342 (11) (2019)
Wouter Cames van Batenburg, Jan Goedgebeur, Gwenaël Joret
Large independent sets in triangle-free cubic graphs: beyond planarity. CoRR (2019)
Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs. J. Graph Theory 92 (4) (2019)
Jan Goedgebeur, Carol T. Zamfirescu
On almost hypohamiltonian graphs. Discret. Math. Theor. Comput. Sci. 21 (4) (2019)
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. Ars Math. Contemp. 16 (2) (2019)
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
The smallest nontrivial snarks of oddness 4. CoRR (2019)
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
An algorithm and new bounds for the circular flow number of snarks. CoRR (2019)
Patrick W. Fowler, John Baptist Gauci, Jan Goedgebeur, Tomaz Pisanski, Irene Sciriha
Existence of $d$-regular nut graphs for $d$ at most 11. CoRR (2019)
Jan Goedgebeur, Oliver Schaudt
-critical H-free graphs. J. Graph Theory 87 (2) (2018)
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
A unified approach to construct snarks with circular flow number 5. CoRR (2018)
Jan Goedgebeur
On the Smallest Snarks with Oddness 4 and Connectivity 2. Electron. J. Comb. 25 (2) (2018)
Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener
On the minimum leaf number of cubic graphs. CoRR (2018)
Geoffrey Exoo, Jan Goedgebeur
Bounds for the smallest k-chromatic graphs of given girth. CoRR (2018)
Jan Goedgebeur, Carol T. Zamfirescu
Infinitely many planar cubic hypohamiltonian graphs of girth 5. J. Graph Theory 88 (1) (2018)
Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo
A note on 2-bisections of claw-free cubic graphs. Discret. Appl. Math. 244 (2018)
Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu
Graphs with few Hamiltonian Cycles. CoRR (2018)
Jan Goedgebeur, Carol T. Zamfirescu
On hypohamiltonian snarks and a theorem of Fiorini. Ars Math. Contemp. 14 (2) (2018)
Jan Goedgebeur, Addie Neyt, Carol T. Zamfirescu
Structural and computational results on platypus graphs. CoRR (2017)
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
Obstructions for three-coloring and list three-coloring H-free graphs. CoRR (2017)
Kris Coolsaet, Patrick W. Fowler, Jan Goedgebeur
Generation and properties of nut graphs. CoRR (2017)
Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs. CoRR (2017)
Jan Goedgebeur, Carol T. Zamfirescu
Improved bounds for hypohamiltonian graphs. Ars Math. Contemp. 13 (2) (2017)
Gunnar Brinkmann, Jan Goedgebeur
Generation of Cubic Graphs and Snarks with Large Girth. J. Graph Theory 86 (2) (2017)
Jan Goedgebeur
On minimal triangle-free 6-chromatic graphs. CoRR (2017)
Jan Goedgebeur
On the smallest snarks with oddness 4 and connectivity 2. CoRR (2017)
Jan Goedgebeur, Edita Mácajová, Martin Skoviera
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. CoRR (2017)
Jan Goedgebeur, Oliver Schaudt
Exhaustive Generation of k-Critical ℋ-Free Graphs. WG (2016)
Jan Goedgebeur, Carol T. Zamfirescu
Improved bounds for hypohamiltonian graphs. CoRR (2016)
Jan Goedgebeur, Carol T. Zamfirescu
On Hypohamiltonian Snarks and a Theorem of Fiorini. CoRR (2016)
Jan Goedgebeur, Carol T. Zamfirescu
New results on hypohamiltonian and almost hypohamiltonian graphs. CoRR (2016)
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
Obstructions for three-coloring graphs with one forbidden induced subgraph. SODA (2016)
Jan Goedgebeur, Brendan D. McKay
Recursive generation of IPR fullerenes. CoRR (2015)
Jan Goedgebeur, Brendan D. McKay
Fullerenes with distant pentagons. CoRR (2015)
Jan Goedgebeur
A counterexample to the pseudo 2-factor isomorphic graph conjecture. Discret. Appl. Math. 193 (2015)
Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
Obstructions for three-coloring graphs without induced paths on six vertices. CoRR (2015)
Jan Goedgebeur, Oliver Schaudt
Exhaustive generation of $k$-critical $\mathcal H$-free graphs. CoRR (2015)
Gunnar Brinkmann, Jan Goedgebeur
Generation of cubic graphs and snarks with large girth. CoRR (2015)
Jan Goedgebeur
A counterexample to the pseudo 2-factor isomorphic graph conjecture. CoRR (2014)
Jan Goedgebeur, Stanislaw P. Radziszowski
New Computational Upper Bounds for Ramsey Numbers R(3, k). Electron. J. Comb. 20 (1) (2013)
Sofie Demeyer, Jan Goedgebeur, Pieter Audenaert, Mario Pickavet, Piet Demeester
Speeding up Martins' algorithm for multiple objective shortest path problems. 4OR 11 (4) (2013)
Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström
Generation and properties of snarks. J. Comb. Theory, Ser. B 103 (4) (2013)
Jan Goedgebeur, Stanislaw P. Radziszowski
The Ramsey Number $R(3, K_{10}-e)$ and Computational Bounds for $R(3, G)$. CoRR (2013)
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
House of Graphs: A database of interesting graphs. Discret. Appl. Math. 161 (1-2) (2013)
Jan Goedgebeur, Stanislaw P. Radziszowski
-e) and Computational Bounds for R(3, G). Electron. J. Comb. 20 (4) (2013)
Gunnar Brinkmann, Jan Goedgebeur, Jan-Christoph Schlage-Puchta
Ramsey numbers R(K3,G) for graphs of order 10 CoRR (2012)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
The Generation of Fullerenes CoRR (2012)
Gunnar Brinkmann, Jan Goedgebeur, Jan-Christoph Schlage-Puchta
, G) for Graphs of Order 10. Electron. J. Comb. 19 (4) (2012)
Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström
Generation and Properties of Snarks CoRR (2012)
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
House of Graphs: a database of interesting graphs CoRR (2012)
Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
A Database of Interesting Graphs: The House of Graphs. CTW (2012)
Jan Goedgebeur, Stanislaw P. Radziszowski
New Computational Upper Bounds for Ramsey Numbers R(3,k) CoRR (2012)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
The Generation of Fullerenes. J. Chem. Inf. Model. 52 (11) (2012)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
Generation of Cubic graphs. Discret. Math. Theor. Comput. Sci. 13 (2) (2011)
Sofie Demeyer, Jan Goedgebeur, Pieter Audenaert, Mario Pickavet, Piet Demeester
The predecessor and the accounting algorithm speed up shortest path calculations in traffic routing applications. ITSC (2010)