default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Goedgebeur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j42]Jan Goedgebeur, Jarne Renders
, Carol T. Zamfirescu:
Generation and new infinite families of K2-hypohamiltonian graphs. Discret. Math. 347(7): 113981 (2024)- [j41]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): 1631-1646 (2024) - [j40]Louis Carpentier, Jorik Jooken, Jan Goedgebeur:
A heuristic algorithm using tree decompositions for the maximum happy vertices problem. J. Heuristics 30(1-2): 67-107 (2024) - [j39]Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu:
K2-Hamiltonian graphs: II. J. Graph Theory 105(4): 580-611 (2024) - [c10]Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt:
Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. MFCS 2024: 55:1-55:15 - [i43]Jan Goedgebeur, Kenta Noguchi, Jarne Renders, Carol T. Zamfirescu:
HIST-Critical Graphs and Malkevitch's Conjecture. CoRR abs/2401.04554 (2024) - 2023
- [j38]Kris Coolsaet, Sven D'hondt, Jan Goedgebeur:
House of Graphs 2.0: A database of interesting graphs and more. Discret. Appl. Math. 325: 97-107 (2023) - [j37]Qingqiong Cai, Jan Goedgebeur, Shenwei Huang:
Some results on k-critical P5-free graphs. Discret. Appl. Math. 334: 91-100 (2023) - [j36]Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel:
Colouring graphs with no induced six-vertex path or diamond. Theor. Comput. Sci. 941: 278-299 (2023) - [c9]Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang:
Critical (P5,dart)-Free Graphs. COCOA (2) 2023: 390-402 - [c8]Jan Goedgebeur, Edita Mácajová, Jarne Renders:
On the Frank Number and Nowhere-Zero Flows on Graphs. WG 2023: 363-375 - [i42]Jan Goedgebeur, Edita Mácajová, Jarne Renders:
Frank number and nowhere-zero flows on graphs. CoRR abs/2305.02133 (2023) - [i41]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 abs/2310.02195 (2023) - [i40]Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu:
K2-Hamiltonian Graphs: II. CoRR abs/2311.05262 (2023) - [i39]Jan Goedgebeur, Jarne Renders, Carol T. Zamfirescu:
Generation and New Infinite Families of K2-hypohamiltonian Graphs. CoRR abs/2311.10593 (2023) - 2022
- [j35]Jan Goedgebeur, Steven Van Overberghe:
New bounds for Ramsey numbers R(Kk-e, Kl-e). Discret. Appl. Math. 307: 212-221 (2022) - [j34]Jan Goedgebeur, Patric R. J. Östergård:
Switching 3-edge-colorings of cubic graphs. Discret. Math. 345(9): 112963 (2022) - [j33]Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
The minimality of the Georges-Kelmans graph. Math. Comput. 91(335): 1483-1500 (2022) - [c7]Jan Goedgebeur:
An introduction to Computational Graph Theory and Generation Algorithms (invited paper). ITAT 2022: 3 - [i38]Louis Carpentier, Jorik Jooken, Jan Goedgebeur:
A heuristic algorithm for the maximum happy vertices problem using tree decompositions. CoRR abs/2208.14921 (2022) - [i37]Kris Coolsaet, Sven D'hondt, Jan Goedgebeur:
House of Graphs 2.0: a database of interesting graphs and more. CoRR abs/2210.17253 (2022) - [i36]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 abs/2211.08105 (2022) - 2021
- [j32]Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
A unified approach to construct snarks with circular flow number 5. J. Graph Theory 97(1): 47-69 (2021) - [j31]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: 98-115 (2021) - [j30]Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi:
k-Critical graphs in P5-free graphs. Theor. Comput. Sci. 864: 80-91 (2021) - [c6]Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel:
Colouring Graphs with No Induced Six-Vertex Path or Diamond. COCOON 2021: 319-329 - [i35]Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
The Minimality of the Georges-Kelmans Graph. CoRR abs/2101.00943 (2021) - [i34]Jan Goedgebeur, Patric R. J. Östergård:
Switching 3-edge-colorings of cubic graphs. CoRR abs/2105.01363 (2021) - [i33]Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel:
Colouring graphs with no induced six-vertex path or diamond. CoRR abs/2106.08602 (2021) - [i32]Jan Goedgebeur, Steven Van Overberghe:
New bounds for Ramsey numbers R(Kk-e, Kl-e). CoRR abs/2107.04460 (2021) - [i31]Qingqiong Cai, Jan Goedgebeur, Shenwei Huang:
Some Results on k-Critical P5-Free Graphs. CoRR abs/2108.05492 (2021) - 2020
- [j29]Jan Goedgebeur, Addie Neyt, Carol T. Zamfirescu:
Structural and computational results on platypus graphs. Appl. Math. Comput. 386: 125491 (2020) - [j28]Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
The smallest nontrivial snarks of oddness 4. Discret. Appl. Math. 277: 139-162 (2020) - [j27]Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
Computational results and new bounds for the circular flow number of snarks. Discret. Math. 343(10): 112026 (2020) - [j26]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): 533-557 (2020) - [j25]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: 45-83 (2020) - [j24]Jan Goedgebeur:
On minimal triangle-free 6-chromatic graphs. J. Graph Theory 93(1): 34-48 (2020) - [j23]Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu:
Graphs with few hamiltonian cycles. Math. Comput. 89(322): 965-991 (2020) - [j22]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): 431-469 (2020) - [c5]Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi:
k-Critical Graphs in P5-Free Graphs. COCOON 2020: 411-422
2010 – 2019
- 2019
- [j21]Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. Ars Math. Contemp. 16(2): 277-298 (2019) - [j20]Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener:
On the minimum leaf number of cubic graphs. Discret. Math. 342(11): 3000-3005 (2019) - [j19]Geoffrey Exoo, Jan Goedgebeur:
Bounds for the smallest k-chromatic graphs of given girth. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j18]Jan Goedgebeur, Carol T. Zamfirescu:
On almost hypohamiltonian graphs. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j17]Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo:
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs. J. Graph Theory 92(4): 415-444 (2019) - [i30]Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
The smallest nontrivial snarks of oddness 4. CoRR abs/1901.10911 (2019) - [i29]Patrick W. Fowler, John Baptist Gauci, Jan Goedgebeur, Tomaz Pisanski, Irene Sciriha:
Existence of $d$-regular nut graphs for $d$ at most 11. CoRR abs/1908.11635 (2019) - [i28]Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
An algorithm and new bounds for the circular flow number of snarks. CoRR abs/1909.09870 (2019) - [i27]Wouter Cames van Batenburg, Jan Goedgebeur, Gwenaël Joret:
Large independent sets in triangle-free cubic graphs: beyond planarity. CoRR abs/1911.12471 (2019) - 2018
- [j16]Jan Goedgebeur, Carol T. Zamfirescu:
On hypohamiltonian snarks and a theorem of Fiorini. Ars Math. Contemp. 14(2): 227-249 (2018) - [j15]Jan Goedgebeur:
On the Smallest Snarks with Oddness 4 and Connectivity 2. Electron. J. Comb. 25(2): 2 (2018) - [j14]Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo:
A note on 2-bisections of claw-free cubic graphs. Discret. Appl. Math. 244: 214-217 (2018) - [j13]Jan Goedgebeur, Oliver Schaudt:
Exhaustive generation of k-critical H-free graphs. J. Graph Theory 87(2): 188-207 (2018) - [j12]Jan Goedgebeur, Carol T. Zamfirescu:
Infinitely many planar cubic hypohamiltonian graphs of girth 5. J. Graph Theory 88(1): 40-45 (2018) - [i26]Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
A unified approach to construct snarks with circular flow number 5. CoRR abs/1804.00957 (2018) - [i25]Geoffrey Exoo, Jan Goedgebeur:
Bounds for the smallest k-chromatic graphs of given girth. CoRR abs/1805.06713 (2018) - [i24]Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener:
On the minimum leaf number of cubic graphs. CoRR abs/1806.04451 (2018) - [i23]Jan Goedgebeur, Barbara Meersman, Carol T. Zamfirescu:
Graphs with few Hamiltonian Cycles. CoRR abs/1812.05650 (2018) - 2017
- [j11]Jan Goedgebeur, Carol T. Zamfirescu:
Improved bounds for hypohamiltonian graphs. Ars Math. Contemp. 13(2): 235-257 (2017) - [j10]Gunnar Brinkmann, Jan Goedgebeur:
Generation of Cubic Graphs and Snarks with Large Girth. J. Graph Theory 86(2): 255-272 (2017) - [i22]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring and list three-coloring H-free graphs. CoRR abs/1703.05684 (2017) - [i21]Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo:
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs. CoRR abs/1705.06928 (2017) - [i20]Jan Goedgebeur:
On minimal triangle-free 6-chromatic graphs. CoRR abs/1707.07581 (2017) - [i19]Kris Coolsaet, Patrick W. Fowler, Jan Goedgebeur:
Generation and properties of nut graphs. CoRR abs/1709.04254 (2017) - [i18]Jan Goedgebeur:
On the smallest snarks with oddness 4 and connectivity 2. CoRR abs/1710.00757 (2017) - [i17]Jan Goedgebeur, Addie Neyt, Carol T. Zamfirescu:
Structural and computational results on platypus graphs. CoRR abs/1712.05158 (2017) - [i16]Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. CoRR abs/1712.07867 (2017) - 2016
- [c4]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs with one forbidden induced subgraph. SODA 2016: 1774-1783 - [c3]Jan Goedgebeur, Oliver Schaudt:
Exhaustive Generation of k-Critical ℋ-Free Graphs. WG 2016: 109-120 - [i15]Jan Goedgebeur, Carol T. Zamfirescu:
Improved bounds for hypohamiltonian graphs. CoRR abs/1602.07171 (2016) - [i14]Jan Goedgebeur, Carol T. Zamfirescu:
New results on hypohamiltonian and almost hypohamiltonian graphs. CoRR abs/1606.06577 (2016) - [i13]Jan Goedgebeur, Carol T. Zamfirescu:
On Hypohamiltonian Snarks and a Theorem of Fiorini. CoRR abs/1608.07164 (2016) - 2015
- [j9]Jan Goedgebeur:
A counterexample to the pseudo 2-factor isomorphic graph conjecture. Discret. Appl. Math. 193: 57-60 (2015) - [i12]Jan Goedgebeur, Brendan D. McKay:
Recursive generation of IPR fullerenes. CoRR abs/1501.02680 (2015) - [i11]Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong:
Obstructions for three-coloring graphs without induced paths on six vertices. CoRR abs/1504.06979 (2015) - [i10]Jan Goedgebeur, Oliver Schaudt:
Exhaustive generation of $k$-critical $\mathcal H$-free graphs. CoRR abs/1506.03647 (2015) - [i9]Jan Goedgebeur, Brendan D. McKay:
Fullerenes with distant pentagons. CoRR abs/1508.02878 (2015) - [i8]Gunnar Brinkmann, Jan Goedgebeur:
Generation of cubic graphs and snarks with large girth. CoRR abs/1512.05944 (2015) - 2014
- [i7]Jan Goedgebeur:
A counterexample to the pseudo 2-factor isomorphic graph conjecture. CoRR abs/1412.3350 (2014) - 2013
- [j8]Sofie Demeyer, Jan Goedgebeur, Pieter Audenaert, Mario Pickavet, Piet Demeester:
Speeding up Martins' algorithm for multiple objective shortest path problems. 4OR 11(4): 323-348 (2013) - [j7]Jan Goedgebeur, Stanislaw P. Radziszowski:
New Computational Upper Bounds for Ramsey Numbers R(3, k). Electron. J. Comb. 20(1): 30 (2013) - [j6]Jan Goedgebeur, Stanislaw P. Radziszowski:
The Ramsey Number R(3, K10-e) and Computational Bounds for R(3, G). Electron. J. Comb. 20(4): 19 (2013) - [j5]Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
House of Graphs: A database of interesting graphs. Discret. Appl. Math. 161(1-2): 311-314 (2013) - [j4]Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström:
Generation and properties of snarks. J. Comb. Theory B 103(4): 468-488 (2013) - [i6]Jan Goedgebeur, Stanislaw P. Radziszowski:
The Ramsey Number $R(3, K_{10}-e)$ and Computational Bounds for $R(3, G)$. CoRR abs/1309.0038 (2013) - 2012
- [j3]Gunnar Brinkmann, Jan Goedgebeur, Jan-Christoph Schlage-Puchta:
Ramsey Numbers R(K3, G) for Graphs of Order 10. Electron. J. Comb. 19(4): 36 (2012) - [j2]Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
The Generation of Fullerenes. J. Chem. Inf. Model. 52(11): 2910-2918 (2012) - [c2]Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
A Database of Interesting Graphs: The House of Graphs. CTW 2012: 36-39 - [i5]Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
House of Graphs: a database of interesting graphs. CoRR abs/1204.3549 (2012) - [i4]Gunnar Brinkmann, Jan Goedgebeur, Jonas Hägglund, Klas Markström:
Generation and Properties of Snarks. CoRR abs/1206.6690 (2012) - [i3]Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
The Generation of Fullerenes. CoRR abs/1207.7010 (2012) - [i2]Gunnar Brinkmann, Jan Goedgebeur, Jan-Christoph Schlage-Puchta:
Ramsey numbers R(K3,G) for graphs of order 10. CoRR abs/1208.0501 (2012) - [i1]Jan Goedgebeur, Stanislaw P. Radziszowski:
New Computational Upper Bounds for Ramsey Numbers R(3,k). CoRR abs/1210.5826 (2012) - 2011
- [j1]Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
Generation of Cubic graphs. Discret. Math. Theor. Comput. Sci. 13(2): 69-80 (2011) - 2010
- [c1]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: 980-985
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
