Contact

Picture Jan Office Jan Goedgebeur
Department of Applied Mathematics, Computer Science and Statistics
Ghent University
Krijgslaan 281 - S9
B-9000 Ghent
Belgium

Phone: +32 9 264 47 70
E-mail: Jan.Goedgebeur[at]UGent.be

Postdoctoral Researcher of the Research Foundation Flanders (FWO)
Curriculum Vitae

Research interests

  • Combinatorics
  • Generation of combinatorial structures
  • Graph algorithms
  • Graph algorithms with applications in medicine
  • Graph colouring
  • Chemical graph theory
  • Hamiltonicity
  • Ramsey numbers
  • Computer-aided theorem proving
  • Optimisation problems
  • Graph theory in general

Publications

Preprints

  1. K. Cameron, J. Goedgebeur, S. Huang and Y. Shi, k-Critical Graphs in P5-free Graphs, 18 pages, 2020. Preprint: (arXiv).

Journal articles

  1. F. Bonomo-Braberman, M. Chudnovsky, J. Goedgebeur, P. Maceli, O. Schaudt, M. Stein and M. Zhong, Better 3-coloring algorithms: excluding a triangle and a seven vertex path, to appear in Theoretical Computer Science, 24 pages, 2020. Preprint: (arXiv).
  2. J. Goedgebeur, D. Mattiolo and G. Mazzuoccolo, A unified approach to construct snarks with circular flow number 5, to appear in Journal of Graph Theory, 27 pages, 2020. Preprint: (arXiv).
  3. W. Cames van Batenburg, J. Goedgebeur and G. Joret, Large independent sets in triangle-free cubic graphs: beyond planarity, Advances in Combinatorics, 2020:7, 45 pages, 2020 (arXiv | DOI).
  4. J. Goedgebeur, A. Neyt and C.T. Zamfirescu, Structural and computational results on platypus graphs, Applied Mathematics and Computation, 386:125491, 10 pages, 2020 (arXiv | DOI).
  5. J. Goedgebeur, D. Mattiolo and G. Mazzuoccolo, Computational results and new bounds for the circular flow number of snarks, Discrete Mathematics, 343(10):112026, 11 pages, 2020 (arXiv | DOI).
  6. J. Goedgebeur, E. Máčajová and M. Škoviera, The smallest nontrivial snarks of oddness 4, Discrete Applied Mathematics, 277:139-162, 2020 (arXiv | DOI).
  7. M. Chudnovsky, J. Goedgebeur, O. Schaudt and M. Zhong, Obstructions for three-coloring and list three-coloring H-free graphs, SIAM Journal on Discrete Mathematics, 34(1):431-469, 2020 (arXiv | DOI).
  8. P.W. Fowler, J.B. Gauci, J. Goedgebeur, T. Pisanski and I. Sciriha, Existence of regular nut graphs for degree at most 11, Discussiones Mathematicae Graph Theory, 40(2):533-557, 2020 (arXiv | DOI).
  9. J. Goedgebeur, B. Meersman and C.T. Zamfirescu, Graphs with few Hamiltonian Cycles, Mathematics of Computation, 89:965-991, 2020 (arXiv | DOI).
  10. M. Chudnovsky, J. Goedgebeur, O. Schaudt and M. Zhong, Obstructions for three-coloring graphs without induced paths on six vertices, Journal of Combinatorial Theory, Series B, 140:45-83, 2020 (arXiv | DOI).
  11. J. Goedgebeur, On minimal triangle-free 6-chromatic graphs, Journal of Graph Theory, 93(1):34-48, 2020 (arXiv | DOI).
  12. J. Goedgebeur and C.T. Zamfirescu, On almost hypohamiltonian graphs, Discrete Mathematics and Theoretical Computer Science, 21(4), 18 pages, 2019 (arXiv | DOI).
  13. N. Vandersickel, E. Van Nieuwenhuyse, N. Van Cleemput, J. Goedgebeur, M. El Haddad, J. De Neve, A. Demolder, T. Strisciuglio, M. Duytschaever and A.V. Panfilov, Directed Networks as a Novel Way to Describe and Analyze Cardiac Excitation: Directed Graph Mapping, Frontiers in Physiology, 10, 14 pages, 2019 (DOI).
  14. J. Goedgebeur, K. Ozeki, N. Van Cleemput and G. Wiener, On the minimum leaf number of cubic graphs, Discrete Mathematics, 342(11):3000-3005, 2019 (arXiv | DOI).
  15. M. Abreu, J. Goedgebeur, D. Labbate and G. Mazzuoccolo, Colourings of cubic graphs inducing isomorphic monochromatic subgraphs, Journal of Graph Theory, 92(4):415-444, 2019 (arXiv | DOI).
  16. G. Exoo and J. Goedgebeur, Bounds for the smallest k-chromatic graphs of given girth, Discrete Mathematics and Theoretical Computer Science, 21(3), 16 pages, 2019 (arXiv | DOI).
  17. J. Goedgebeur, E. Máčajová and M. Škoviera, Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44, Ars Mathematica Contemporanea, 16(2):277-298, 2019 (arXiv | DOI).
  18. J. Goedgebeur, On the smallest snarks with oddness 4 and connectivity 2, Electronic Journal of Combinatorics, 25(2), 5 pages, 2018 (arXiv | pdf).
  19. M. Abreu, J. Goedgebeur, D. Labbate and G. Mazzuoccolo, A note on 2-bisections of claw-free cubic graphs, Discrete Applied Mathematics, 244:214-217, 2018 (arXiv | DOI).
  20. K. Coolsaet, P.W. Fowler and J. Goedgebeur, Generation and properties of nut graphs, MATCH Commun. Math. Comput. Chem., 80(2):423-444, 2018 (arXiv | pdf).
  21. J. Goedgebeur and C.T. Zamfirescu, Infinitely many planar cubic hypohamiltonian graphs of girth 5, Journal of Graph Theory, 88(1):40-45, 2018 (DOI).
  22. J. Goedgebeur and C.T. Zamfirescu, On Hypohamiltonian Snarks and a Theorem of Fiorini, Ars Mathematica Contemporanea, 14(2):227-249, 2018 (arXiv | DOI).
  23. J. Goedgebeur and O. Schaudt, Exhaustive generation of k-critical H-free graphs, Journal of Graph Theory, 87(2):188-207, 2018 (arXiv | DOI).
  24. J. Goedgebeur and C.T. Zamfirescu, Improved bounds for hypohamiltonian graphs, Ars Mathematica Contemporanea, 13(2):235-257, 2017 (arXiv | DOI).
  25. G. Brinkmann and J. Goedgebeur, Generation of cubic graphs and snarks with large girth, Journal of Graph Theory, 86(2):255-272, 2017 (arXiv | DOI).
  26. J. Goedgebeur and B.D. McKay, Fullerenes with distant pentagons, MATCH Commun. Math. Comput. Chem., 74(3):659-672, 2015 (arXiv | pdf).
  27. J. Goedgebeur and B.D. McKay, Recursive generation of IPR fullerenes, Journal of Mathematical Chemistry, 53(8):1702-1724, 2015 (arXiv | DOI).
  28. J. Goedgebeur, A counterexample to the pseudo 2-factor isomorphic graph conjecture, Discrete Applied Mathematics, 193:57-60, 2015 (arXiv | DOI).
  29. J. Goedgebeur and S.P. Radziszowski, The Ramsey Number R(3,K10-e) and Computational Bounds for R(3,G), Electronic Journal of Combinatorics, 20(4), 25 pages, 2013 (arXiv | pdf).
  30. G. Brinkmann, J. Goedgebeur and N. Van Cleemput, The History of the Generation of Cubic Graphs, International Journal of Chemical Modeling, 5(2-3):67-89, 2013 (pdf).
  31. G. Brinkmann, J. Goedgebeur, J. Hägglund and K. Markström, Generation and properties of Snarks, Journal of Combinatorial Theory, Series B, 103(4):468-488, 2013 (arXiv | DOI).
  32. J. Goedgebeur and S.P. Radziszowski, New computational upper bounds for Ramsey numbers R(3,k), Electronic Journal of Combinatorics, 20(1), 28 pages, 2013 (arXiv | pdf).
  33. G. Brinkmann, K. Coolsaet, J. Goedgebeur and H. Mélot, House of Graphs: a database of interesting graphs, Discrete Applied Mathematics, 161(1-2):311-314, 2013 (arXiv | DOI).
  34. S. Demeyer, J. Goedgebeur, P. Audenaert, M. Pickavet and P. Demeester, Speeding up Martins' algorithm for multiple objective shortest path problems, 4OR: A Quarterly Journal of Operations Research, 11(4):323-348, 2013. (DOI).
  35. G. Brinkmann, J. Goedgebeur and J.C. Schlage-Puchta, Ramsey numbers R(K3,G) for graphs of order 10, Electronic Journal of Combinatorics, 19(4), 23 pages, 2012 (arXiv | pdf).
  36. G. Brinkmann, J. Goedgebeur and B.D. McKay, The Generation of Fullerenes, Journal of Chemical Information and Modeling, 52(11):2910-2918, 2012 (arXiv | DOI).
  37. G. Brinkmann, J. Goedgebeur and B.D. McKay, The smallest fullerene without a spiral, Chemical Physics Letters, 522:54-55, 2012 (DOI | pdf).
  38. G. Brinkmann, J. Goedgebeur and B.D. McKay, Generation of Cubic graphs, Discrete Mathematics and Theoretical Computer Science, 13(2):69-80, 2011 (link | pdf).

Conference papers

  1. K. Cameron, J. Goedgebeur, S. Huang and Y. Shi, k-Critical Graphs in P5-free Graphs, In Proc. 26th International Computing and Combinatorics Conference (COCOON2020), Atlanta, Georgia, USA, LNCS 12273, pages 411-422, 2020 (DOI).
  2. J. Goedgebeur and O. Schaudt, Exhaustive generation of k-critical H-free graphs, In Proc. 42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG2016), Istanbul, Turkey, LNCS 9941, pages 109-120, 2016 (DOI).
  3. M. Chudnovsky, J. Goedgebeur, O. Schaudt and M. Zhong, Obstructions for three-coloring graphs with one forbidden induced subgraph, In Proc. Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA16), Arlington, Virginia, USA, pages 1774-1783, 2016 (DOI).
  4. S. Demeyer, J. Goedgebeur, P. Audenaert, M. Pickavet and P. Demeester, The predecessor and the accounting algorithm speed up shortest path calculations in traffic routing applications, In Proc. 13th International IEEE Conference on Intelligent Transportation Systems (ITSC2010), Madeira Island, Portugal, pages 980-985, 2010 (DOI).

Ph.D. thesis

On 24 May 2013 I defended my Ph.D. thesis titled "Generation Algorithms for Mathematical and Chemical Problems". My thesis can be downloaded here and the slides of my public defence here.

Attended conferences

  • 21st French Graph Theory Conference (JGA 2019), Brussels, Belgium, 13-15/11/19.
  • 9th Slovenian International Conference on Graph Theory, Bled, Slovenia, 23-29/06/19.
  • Colloquium on Combinatorics 2018, Paderborn, Germany, 23-24/11/18.
  • Bucharest Graph Theory Workshop, Bucharest, Roumania, 15-17/08/18.
  • 10th International Colloqium on Graph Theory and Combinatorics, Lyon, France, 09-13/07/18.
  • Colloquium on Combinatorics 2017, Paderborn, Germany, 24-25/11/17.
  • Computers in Scientific Discovery 8, Mons, Belgium, 23-25/08/17.
  • Canadian Discrete and Algorithmic Mathematics Conference 2017, Toronto, Canada, 12-15/06/17.
  • Bordeaux Graph Workshop, Bordeaux, France, 07-10/11/16.
  • Graph Theory Workshop on Longest Paths and Longest Cycles, Ghent, Belgium, 01-02/08/16.
  • Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA16), Arlington, Virginia, USA, 10-12/01/16.
  • Colloquium on Combinatorics 2015, Ilmenau, Germany, 06-07/11/15.
  • Canadian Discrete and Algorithmic Mathematics Conference 2015, Saskatoon, Canada, 01-04/06/15.
  • Colloquium on Combinatorics 2014, Ilmenau, Germany, 07-08/11/14.
  • Canadian Discrete and Algorithmic Mathematics Conference 2013, St. John's, Canada, 10-13/06/13.
  • GraphDay@Mons, Mons, Belgium, 05/03/13.
  • Colloquium on Combinatorics 2012, Berlin, Germany, 16-17/11/12.
  • Computers in Scientific Discovery 6, Portorož, Slovenia, 21-25/08/12.
  • International Congress on Computational and Applied Mathematics 2012, Ghent, Belgium, 09-13/07/12.
  • SIAM Conference on Discrete Mathematics 2012, Halifax, Canada, 18-21/06/12.
  • Colloquium on Combinatorics 2011, Magdeburg, Germany, 11-12/11/11.
  • Colloquium on Combinatorics 2010, Saarbrücken, Germany, 12-13/11/10.
  • Workshop on Discrete Mathematics and Algorithms, Brussels, Belgium, 05/10/10.
  • Computers in Scientific Discovery 5, Sheffield, UK, 20-23/07/10.
  • 8th French Combinatorial Conference, Orsay, France, 28/06 - 02/07/10.
  • Cologne Twente Workshop 2010, Cologne, Germany, 25-27/05/10.
  • Second educational innovation day of Ghent University, Ghent, Belgium, 16/11/09.
  • Colloquium on Combinatorics 2009, Magdeburg, Germany, 13-14/11/09.

Software

Other