Jan Goedgebeur

115 papers A* 1B 4C 1Misc 2Journal 101Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Knowledge management in House of Graphs. CoRR Gauvain Devillez, Sven D'hondt, Jan Goedgebeur
2026	J	`jnl`	Minimal obstructions to C5-coloring in hereditary graph classes. Inf. Comput. Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt
2026	B	`conf`	On the Order-Diameter Ratio of Girth-Diameter Cages. SOFSEM Stijn Cambie, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede
2026	J	`jnl`	On the existence of factors intersecting sets of cycles in regular graphs. Eur. J. Comb. Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo, Jarne Renders, Luca Toffanetti, Isaak H. Wolf
2026	J	`jnl`	Online dispatching and routing for automated guided vehicles in pickup and delivery systems on loop-based graphs. J. Comb. Optim. Louis Stubbe, Jens Goemaere, Jan Goedgebeur
2026	J	`jnl`	Vertex-critical (P5, W4)-free graphs. Theor. Comput. Sci. Wen Xia, Jorik Jooken, Jan Goedgebeur, Iain Beaton, Ben Cameron, Shenwei Huang
2025	J	`jnl`	Critical (P5,dart)-free graphs. Discret. Appl. Math. Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang
2025	—	`conf`	Generation of Cycle Permutation Graphs and Permutation Snarks. SOFSEM (1) Jan Goedgebeur, Jarne Renders
2025	J	`jnl`	Improved lower bounds on the maximum size of graphs with girth 5. CoRR Jan Goedgebeur, Jorik Jooken, Gwenaël Joret, Tibo Van den Eede
2025	J	`jnl`	Network fault costs based on minimum leaf spanning trees. CoRR Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu
2025	J	`jnl`	New small regular graphs of given girth: the cage problem and beyond. CoRR Geoffrey Exoo, Jan Goedgebeur, Jorik Jooken, Louis Stubbe, Tibo Van den Eede
2025	J	`jnl`	On the order-diameter ratio of girth-diameter cages. CoRR Stijn Cambie, Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede
2025	J	`jnl`	Some Results on Critical (P5,H)-free Graphs. Theor. Comput. Sci. Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang
2025	J	`jnl`	The Frank number and nowhere-zero flows on graphs. Eur. J. Comb. Jan Goedgebeur, Edita Mácajová, Jarne Renders
2025	J	`jnl`	The Gray graph is pseudo 2-factor isomorphic. CoRR Marién Abreu, Jan Goedgebeur, Jorik Jooken, Federico Romaniello, Tibo Van den Eede
2025	J	`jnl`	The Maximum Number of Connected Sets in Regular Graphs. Electron. J. Comb. Stijn Cambie, Jorik Jooken, Jan Goedgebeur
2025	—	`conf`	Vertex-Critical (P COCOON (2) Wen Xia, Jorik Jooken, Jan Goedgebeur, Iain Beaton, Ben Cameron, Shenwei Huang
2024	J	`jnl`	A heuristic algorithm using tree decompositions for the maximum happy vertices problem. J. Heuristics Louis Carpentier, Jorik Jooken, Jan Goedgebeur
2024	J	`jnl`	Computational methods for finding bi-regular cages. CoRR Jan Goedgebeur, Jorik Jooken, Tibo Van den Eede
2024	J	`jnl`	Generation and new infinite families of K2-hypohamiltonian graphs. Discret. Math. Jan Goedgebeur, Jarne Renders, Carol T. Zamfirescu
2024	J	`jnl`	Generation of Cycle Permutation Graphs and Permutation Snarks. CoRR Jan Goedgebeur, Jarne Renders
2024	J	`jnl`	HIST-Critical Graphs and Malkevitch's Conjecture. CoRR Jan Goedgebeur, Kenta Noguchi, Jarne Renders, Carol T. Zamfirescu
2024	J	`jnl`	Infinite families of planar graphs of a given injective chromatic number. CoRR Matias Daneels, Jan Goedgebeur, Jarne Renders
2024	B	`conf`	Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. MFCS Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt
2024	J	`jnl`	On non-hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs. Discuss. Math. Graph Theory Jan Goedgebeur, Thomas Gringore, Carol T. Zamfirescu
2024	J	`jnl`	On the existence of factors intersecting sets of cycles in regular graphs. CoRR Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo, Jarne Renders, Luca Toffanetti, Isaak H. Wolf
2024	—	`conf`	Some Results on Critical (P COCOON (1) Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang
2023	J	`jnl`	Colouring graphs with no induced six-vertex path or diamond. Theor. Comput. Sci. Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel
2023	—	`conf`	Critical (P COCOA (2) Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang
2023	J	`jnl`	Efficient Online Scheduling and Routing for Automated Guided Vehicles: Comparing a Novel Loop-Based Algorithm Against Existing Methods. CoRR Louis Stubbe, Jens Goemaere, Jan Goedgebeur
2023	J	`jnl`	Frank number and nowhere-zero flows on graphs. CoRR Jan Goedgebeur, Edita Mácajová, Jarne Renders
2023	J	`jnl`	Generation and New Infinite Families of K CoRR Jan Goedgebeur, Jarne Renders, Carol T. Zamfirescu
2023	J	`jnl`	House of Graphs 2.0: A database of interesting graphs and more. Discret. Appl. Math. Kris Coolsaet, Sven D'hondt, Jan Goedgebeur
2023	J	`jnl`	K CoRR Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu
2023	B	`conf`	On the Frank Number and Nowhere-Zero Flows on Graphs. WG Jan Goedgebeur, Edita Mácajová, Jarne Renders
2023	J	`jnl`	Some results on k-critical P5-free graphs. Discret. Appl. Math. Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
2022	J	`jnl`	A heuristic algorithm for the maximum happy vertices problem using tree decompositions. CoRR Louis Carpentier, Jorik Jooken, Jan Goedgebeur
2022	—	`conf`	An introduction to Computational Graph Theory and Generation Algorithms (invited paper). ITAT Jan Goedgebeur
2022	J	`jnl`	Few hamiltonian cycles in graphs with one or two vertex degrees. CoRR Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo, Ben Seamone, Carol T. Zamfirescu
2022	J	`jnl`	House of Graphs 2.0: a database of interesting graphs and more. CoRR Kris Coolsaet, Sven D'hondt, Jan Goedgebeur
2022	J	`jnl`	New bounds for Ramsey numbers R(Kk-e, Kl-e). Discret. Appl. Math. Jan Goedgebeur, Steven Van Overberghe
2022	J	`jnl`	Switching 3-edge-colorings of cubic graphs. Discret. Math. Jan Goedgebeur, Patric R. J. Östergård
2022	J	`jnl`	The minimality of the Georges-Kelmans graph. Math. Comput. Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
2021	J	`jnl`	A unified approach to construct snarks with circular flow number 5. J. Graph Theory Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
2021	J	`jnl`	Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci. Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
2021	Misc	`conf`	Colouring Graphs with No Induced Six-Vertex Path or Diamond. COCOON Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel
2021	J	`jnl`	Colouring graphs with no induced six-vertex path or diamond. CoRR Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel
2021	J	`jnl`	New bounds for Ramsey numbers R(K CoRR Jan Goedgebeur, Steven Van Overberghe
2021	J	`jnl`	Some Results on k-Critical P CoRR Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
2021	J	`jnl`	Switching 3-edge-colorings of cubic graphs. CoRR Jan Goedgebeur, Patric R. J. Östergård
2021	J	`jnl`	The Minimality of the Georges-Kelmans Graph. CoRR Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
2020	J	`jnl`	Computational results and new bounds for the circular flow number of snarks. Discret. Math. Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
2020	J	`jnl`	Existence of regular nut graphs for degree at most 11. Discuss. Math. Graph Theory Patrick W. Fowler, John Baptist Gauci, Jan Goedgebeur, Tomaz Pisanski, Irene Sciriha
2020	J	`jnl`	Graphs with few hamiltonian cycles. Math. Comput. Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu
2020	J	`jnl`	Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs. SIAM J. Discret. Math. Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2020	J	`jnl`	Obstructions for three-coloring graphs without induced paths on six vertices. J. Comb. Theory, Ser. B Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2020	J	`jnl`	On minimal triangle-free 6-chromatic graphs. J. Graph Theory Jan Goedgebeur
2020	J	`jnl`	Structural and computational results on platypus graphs. Appl. Math. Comput. Jan Goedgebeur, Addie Neyt, Carol T. Zamfirescu
2020	J	`jnl`	The smallest nontrivial snarks of oddness 4. Discret. Appl. Math. Jan Goedgebeur, Edita Mácajová, Martin Skoviera
2020	Misc	`conf`	k-Critical Graphs in P COCOON Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi
2019	J	`jnl`	An algorithm and new bounds for the circular flow number of snarks. CoRR Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
2019	J	`jnl`	Bounds for the smallest k-chromatic graphs of given girth. Discret. Math. Theor. Comput. Sci. Geoffrey Exoo, Jan Goedgebeur
2019	J	`jnl`	Colourings of cubic graphs inducing isomorphic monochromatic subgraphs. J. Graph Theory Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo
2019	J	`jnl`	Existence of $d$-regular nut graphs for $d$ at most 11. CoRR Patrick W. Fowler, John Baptist Gauci, Jan Goedgebeur, Tomaz Pisanski, Irene Sciriha
2019	J	`jnl`	Large independent sets in triangle-free cubic graphs: beyond planarity. CoRR Wouter Cames van Batenburg, Jan Goedgebeur, Gwenaël Joret
2019	J	`jnl`	On almost hypohamiltonian graphs. Discret. Math. Theor. Comput. Sci. Jan Goedgebeur, Carol T. Zamfirescu
2019	J	`jnl`	On the minimum leaf number of cubic graphs. Discret. Math. Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener
2019	J	`jnl`	Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. Ars Math. Contemp. Jan Goedgebeur, Edita Mácajová, Martin Skoviera
2019	J	`jnl`	The smallest nontrivial snarks of oddness 4. CoRR Jan Goedgebeur, Edita Mácajová, Martin Skoviera
2018	J	`jnl`	A note on 2-bisections of claw-free cubic graphs. Discret. Appl. Math. Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo
2018	J	`jnl`	A unified approach to construct snarks with circular flow number 5. CoRR Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
2018	J	`jnl`	Bounds for the smallest k-chromatic graphs of given girth. CoRR Geoffrey Exoo, Jan Goedgebeur
2018	J	`jnl`	Exhaustive generation of J. Graph Theory Jan Goedgebeur, Oliver Schaudt
2018	J	`jnl`	Graphs with few Hamiltonian Cycles. CoRR Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu
2018	J	`jnl`	Infinitely many planar cubic hypohamiltonian graphs of girth 5. J. Graph Theory Jan Goedgebeur, Carol T. Zamfirescu
2018	J	`jnl`	On hypohamiltonian snarks and a theorem of Fiorini. Ars Math. Contemp. Jan Goedgebeur, Carol T. Zamfirescu
2018	J	`jnl`	On the Smallest Snarks with Oddness 4 and Connectivity 2. Electron. J. Comb. Jan Goedgebeur
2018	J	`jnl`	On the minimum leaf number of cubic graphs. CoRR Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener
2017	J	`jnl`	Colourings of cubic graphs inducing isomorphic monochromatic subgraphs. CoRR Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo
2017	J	`jnl`	Generation and properties of nut graphs. CoRR Kris Coolsaet, Patrick W. Fowler, Jan Goedgebeur
2017	J	`jnl`	Generation of Cubic Graphs and Snarks with Large Girth. J. Graph Theory Gunnar Brinkmann, Jan Goedgebeur
2017	J	`jnl`	Improved bounds for hypohamiltonian graphs. Ars Math. Contemp. Jan Goedgebeur, Carol T. Zamfirescu
2017	J	`jnl`	Obstructions for three-coloring and list three-coloring H-free graphs. CoRR Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2017	J	`jnl`	On minimal triangle-free 6-chromatic graphs. CoRR Jan Goedgebeur
2017	J	`jnl`	On the smallest snarks with oddness 4 and connectivity 2. CoRR Jan Goedgebeur
2017	J	`jnl`	Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. CoRR Jan Goedgebeur, Edita Mácajová, Martin Skoviera
2017	J	`jnl`	Structural and computational results on platypus graphs. CoRR Jan Goedgebeur, Addie Neyt, Carol T. Zamfirescu
2016	B	`conf`	Exhaustive Generation of k-Critical ℋ-Free Graphs. WG Jan Goedgebeur, Oliver Schaudt
2016	J	`jnl`	Improved bounds for hypohamiltonian graphs. CoRR Jan Goedgebeur, Carol T. Zamfirescu
2016	J	`jnl`	New results on hypohamiltonian and almost hypohamiltonian graphs. CoRR Jan Goedgebeur, Carol T. Zamfirescu
2016	A*	`conf`	Obstructions for three-coloring graphs with one forbidden induced subgraph. SODA Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2016	J	`jnl`	On Hypohamiltonian Snarks and a Theorem of Fiorini. CoRR Jan Goedgebeur, Carol T. Zamfirescu
2015	J	`jnl`	A counterexample to the pseudo 2-factor isomorphic graph conjecture. Discret. Appl. Math. Jan Goedgebeur
2015	J	`jnl`	Exhaustive generation of $k$-critical $\mathcal H$-free graphs. CoRR Jan Goedgebeur, Oliver Schaudt
2015	J	`jnl`	Fullerenes with distant pentagons. CoRR Jan Goedgebeur, Brendan D. McKay
2015	J	`jnl`	Generation of cubic graphs and snarks with large girth. CoRR Gunnar Brinkmann, Jan Goedgebeur
2015	J	`jnl`	Obstructions for three-coloring graphs without induced paths on six vertices. CoRR Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong
2015	J	`jnl`	Recursive generation of IPR fullerenes. CoRR Jan Goedgebeur, Brendan D. McKay
2014	J	`jnl`	A counterexample to the pseudo 2-factor isomorphic graph conjecture. CoRR Jan Goedgebeur
2013	J	`jnl`	Generation and properties of snarks. J. Comb. Theory B Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström
2013	J	`jnl`	House of Graphs: A database of interesting graphs. Discret. Appl. Math. Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
2013	J	`jnl`	New Computational Upper Bounds for Ramsey Numbers R(3, k). Electron. J. Comb. Jan Goedgebeur, Stanislaw P. Radziszowski
2013	J	`jnl`	Speeding up Martins' algorithm for multiple objective shortest path problems. 4OR Sofie Demeyer, Jan Goedgebeur, Pieter Audenaert, Mario Pickavet, Piet Demeester
2013	J	`jnl`	The Ramsey Number $R(3, K_{10}-e)$ and Computational Bounds for $R(3, G)$. CoRR Jan Goedgebeur, Stanislaw P. Radziszowski
2013	J	`jnl`	The Ramsey Number R(3, K Electron. J. Comb. Jan Goedgebeur, Stanislaw P. Radziszowski
2012	C	`conf`	A Database of Interesting Graphs: The House of Graphs. CTW Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
2012	J	`jnl`	Generation and Properties of Snarks CoRR Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström
2012	J	`jnl`	House of Graphs: a database of interesting graphs CoRR Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
2012	J	`jnl`	New Computational Upper Bounds for Ramsey Numbers R(3,k) CoRR Jan Goedgebeur, Stanislaw P. Radziszowski
2012	J	`jnl`	Ramsey Numbers R(K Electron. J. Comb. Gunnar Brinkmann, Jan Goedgebeur, Jan-Christoph Schlage-Puchta
2012	J	`jnl`	Ramsey numbers R(K3,G) for graphs of order 10 CoRR Gunnar Brinkmann, Jan Goedgebeur, Jan-Christoph Schlage-Puchta
2012	J	`jnl`	The Generation of Fullerenes CoRR Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
2012	J	`jnl`	The Generation of Fullerenes. J. Chem. Inf. Model. Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
2011	J	`jnl`	Generation of Cubic graphs. Discret. Math. Theor. Comput. Sci. Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
2010	—	`conf`	The predecessor and the accounting algorithm speed up shortest path calculations in traffic routing applications. ITSC Sofie Demeyer, Jan Goedgebeur, Pieter Audenaert, Mario Pickavet, Piet Demeester