Jan Goedgebeur

According to our database1, Jan Goedgebeur authored at least 45 papers between 2010 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Obstructions for Three-Coloring and List Three-Coloring H-Free Graphs.
SIAM J. Discret. Math., 2020

Graphs with few hamiltonian cycles.
Math. Comput., 2020

On minimal triangle-free 6-chromatic graphs.
J. Graph Theory, 2020

Obstructions for three-coloring graphs without induced paths on six vertices.
J. Comb. Theory, Ser. B, 2020

Existence of regular nut graphs for degree at most 11.
Discuss. Math. Graph Theory, 2020

Computational results and new bounds for the circular flow number of snarks.
Discret. Math., 2020

The smallest nontrivial snarks of oddness 4.
Discret. Appl. Math., 2020

Structural and computational results on platypus graphs.
Appl. Math. Comput., 2020

k-Critical Graphs in P<sub>5</sub>-Free Graphs.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs.
J. Graph Theory, 2019

On almost hypohamiltonian graphs.
Discret. Math. Theor. Comput. Sci., 2019

Bounds for the smallest k-chromatic graphs of given girth.
Discret. Math. Theor. Comput. Sci., 2019

On the minimum leaf number of cubic graphs.
Discret. Math., 2019

Large independent sets in triangle-free cubic graphs: beyond planarity.
CoRR, 2019

An algorithm and new bounds for the circular flow number of snarks.
CoRR, 2019

Existence of $d$-regular nut graphs for $d$ at most 11.
CoRR, 2019

Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44.
Ars Math. Contemp., 2019

2018
Infinitely many planar cubic hypohamiltonian graphs of girth 5.
J. Graph Theory, 2018

Exhaustive generation of <i>k</i>-critical H-free graphs.
J. Graph Theory, 2018

A note on 2-bisections of claw-free cubic graphs.
Discret. Appl. Math., 2018

A unified approach to construct snarks with circular flow number 5.
CoRR, 2018

On the Smallest Snarks with Oddness 4 and Connectivity 2.
Electron. J. Comb., 2018

On hypohamiltonian snarks and a theorem of Fiorini.
Ars Math. Contemp., 2018

2017
Generation of Cubic Graphs and Snarks with Large Girth.
J. Graph Theory, 2017

Generation and properties of nut graphs.
CoRR, 2017

Improved bounds for hypohamiltonian graphs.
Ars Math. Contemp., 2017

2016
New results on hypohamiltonian and almost hypohamiltonian graphs.
CoRR, 2016

Exhaustive Generation of k-Critical ℋ-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Obstructions for three-coloring graphs with one forbidden induced subgraph.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
A counterexample to the pseudo 2-factor isomorphic graph conjecture.
Discret. Appl. Math., 2015

Exhaustive generation of $k$-critical $\mathcal H$-free graphs.
CoRR, 2015

Fullerenes with distant pentagons.
CoRR, 2015

Recursive generation of IPR fullerenes.
CoRR, 2015

2013
Generation and properties of snarks.
J. Comb. Theory, Ser. B, 2013

House of Graphs: A database of interesting graphs.
Discret. Appl. Math., 2013

The Ramsey Number $R(3, K_{10}-e)$ and Computational Bounds for $R(3, G)$.
CoRR, 2013

The Ramsey Number R(3, K<sub>10</sub>-e) and Computational Bounds for R(3, G).
Electron. J. Comb., 2013

New Computational Upper Bounds for Ramsey Numbers R(3, k).
Electron. J. Comb., 2013

Speeding up Martins' algorithm for multiple objective shortest path problems.
4OR, 2013

2012
The Generation of Fullerenes.
J. Chem. Inf. Model., 2012

Ramsey numbers R(K3,G) for graphs of order 10
CoRR, 2012

Ramsey Numbers R(K<sub>3</sub>, G) for Graphs of Order 10.
Electron. J. Comb., 2012

A Database of Interesting Graphs: The House of Graphs.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
Generation of Cubic graphs.
Discret. Math. Theor. Comput. Sci., 2011

2010
The predecessor and the accounting algorithm speed up shortest path calculations in traffic routing applications.
Proceedings of the 13th International IEEE Conference on Intelligent Transportation Systems, 2010


  Loading...