Jan Goedgebeur

Contact

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 Fax: +32 9 264 49 95 E-mail: Jan.Goedgebeur[at]UGent.be Postdoctoral Researcher of the Research Foundation Flanders (FWO) Curriculum Vitae

Research interests

• Generation of combinatorial structures
• Graph algorithms
• Graph colouring
• Chemical graph theory
• Ramsey numbers
• Computer-aided theorem proving
• Graph theory in general

Publications

Preprints

1. J. Goedgebeur, D. Mattiolo and G. Mazzuoccolo, A unified approach to construct snarks with circular flow number 5, 27 pages, 2018. Preprint: (arXiv).
2. J. Goedgebeur, E. Máčajová and M. Škoviera, Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44, 20 pages, 2017. Preprint: (arXiv).
3. J. Goedgebeur, A. Neyt and C.T. Zamfirescu, Structural and computational results on platypus graphs, 20 pages, 2017. Preprint: (arXiv).
4. J. Goedgebeur, On the smallest snarks with oddness 4 and connectivity 2, 5 pages, 2017. Preprint: (arXiv).
5. J. Goedgebeur, On minimal triangle-free 6-chromatic graphs, 15 pages, 2017. Preprint: (arXiv).
6. M. Abreu, J. Goedgebeur, D. Labbate and G. Mazzuoccolo, Colourings of cubic graphs inducing isomorphic monochromatic subgraphs, 31 pages, 2017. Preprint: (arXiv).
7. M. Chudnovsky, J. Goedgebeur, O. Schaudt and M. Zhong, Obstructions for three-coloring and list three-coloring H-free graphs, 40 pages, 2017. Preprint: (arXiv).
8. J. Goedgebeur and C.T. Zamfirescu, On almost hypohamiltonian graphs, 20 pages, 2016. Preprint: (arXiv).
9. M. Chudnovsky, J. Goedgebeur, O. Schaudt and M. Zhong, Obstructions for three-coloring graphs without induced paths on six vertices, 27 pages, 2015. Preprint: (arXiv).

Journal articles

1. M. Abreu, J. Goedgebeur, D. Labbate and G. Mazzuoccolo, A note on 2--bisections of claw--free cubic graphs,
   to appear in Discrete Applied Mathematics, 5 pages, 2017. Preprint: (arXiv | DOI).
2. K. Coolsaet, P.W. Fowler and J. Goedgebeur, Generation and properties of nut graphs,
   to appear in MATCH Commun. Math. Comput. Chem., 23 pages, 2017. Preprint: (arXiv).
3. J. Goedgebeur and C.T. Zamfirescu, Infinitely many planar cubic hypohamiltonian graphs of girth 5,
   Journal of Graph Theory, 88(1):40-45, 2018. Preprint: (arXiv | DOI).
4. J. Goedgebeur and C.T. Zamfirescu, On Hypohamiltonian Snarks and a Theorem of Fiorini,
   Ars Mathematica Contemporanea, 14(2):227-249, 2018 (arXiv | pdf).
5. J. Goedgebeur and O. Schaudt, Exhaustive generation of k-critical H-free graphs,
   Journal of Graph Theory, 87(2):188-207, 2018. Preprint: (arXiv | DOI).
6. J. Goedgebeur and C.T. Zamfirescu, Improved bounds for hypohamiltonian graphs,
   Ars Mathematica Contemporanea, 13(2):235-257, 2017 (arXiv | pdf).
7. G. Brinkmann and J. Goedgebeur, Generation of cubic graphs and snarks with large girth,
   Journal of Graph Theory, 86(2):255-272, 2017. Preprint: (arXiv | DOI).
8. J. Goedgebeur and B.D. McKay, Fullerenes with distant pentagons,
   MATCH Commun. Math. Comput. Chem., 74(3):659-672, 2015 (arXiv | pdf).
9. J. Goedgebeur and B.D. McKay, Recursive generation of IPR fullerenes,
   Journal of Mathematical Chemistry, 53(8):1702-1724, 2015 (arXiv | DOI).
10. J. Goedgebeur, A counterexample to the pseudo 2-factor isomorphic graph conjecture,
    Discrete Applied Mathematics, 193:57-60, 2015 (arXiv | DOI).
11. 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).
12. 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).
13. 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).
14. 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).
15. 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).
16. 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).
17. 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).
18. 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).
19. G. Brinkmann, J. Goedgebeur and B.D. McKay, The smallest fullerene without a spiral,
    Chemical Physics Letters, 522:54-55, 2012 (DOI | pdf).
20. G. Brinkmann, J. Goedgebeur and B.D. McKay, Generation of Cubic graphs,
    Discrete Mathematics and Theoretical Computer Science, 13(2):69-80, 2011 (pdf).

Conference papers

1. 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).
2. 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).
3. 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

Attended conferences

• 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

• Buckygen is a generator for fullerenes.
• CriticalPfreeGraphs is a generator for k-critical Pt-free graphs.
• ListCriticalPfreeGraphs is a generator for list k-critical Pt-free graphs.
• GenHypohamiltonian is a generator for hypohamiltonian and almost hypohamiltonian graphs.
• Snarkhunter is a generator for connected cubic graphs and snarks.
• Triangleramsey is a generator for maximal triangle-free graphs and Ramsey graphs.

Other

• Co-organiser of the Ghent Graph Theory Workshop.
• Visiting fellow at the Rochester Institute of Technology, Rochester, April 2013.
• Visiting fellow at the Australian National University, Canberra, February - June 2011.
• Webmaster of the Computers in Scientific Discovery 5 website.
• Webmaster of House of Graphs.

Links

• CaGe
• Grinvin
• House of Graphs
• Lists of all Snarks up to 36 vertices
• Brendan McKay's Homepage
• Staszek Radziszowski's Homepage
• Blog on Computational Combinatorics
• The On-Line Encyclopedia of Integer Sequences