According to our database
1,
Jan Goedgebeur
authored at least 74 papers
between 2010 and 2025.
Collaborative distances:
2025
Critical (P5,dart)-free graphs.
Discret. Appl. Math., 2025
Generation of Cycle Permutation Graphs and Permutation Snarks.
Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025
2024
<i>K</i><sub>2</sub>-Hamiltonian graphs: II.
J. Graph Theory, April, 2024
A heuristic algorithm using tree decompositions for the maximum happy vertices problem.
J. Heuristics, April, 2024
On non-hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs.
Discuss. Math. Graph Theory, 2024
Generation and new infinite families of K2-hypohamiltonian graphs.
Discret. Math., 2024
Infinite families of planar graphs of a given injective chromatic number.
CoRR, 2024
Computational methods for finding bi-regular cages.
CoRR, 2024
On the existence of factors intersecting sets of cycles in regular graphs.
CoRR, 2024
HIST-Critical Graphs and Malkevitch's Conjecture.
CoRR, 2024
Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024
2023
Some results on k-critical P5-free graphs.
Discret. Appl. Math., July, 2023
Colouring graphs with no induced six-vertex path or diamond.
Theor. Comput. Sci., 2023
House of Graphs 2.0: A database of interesting graphs and more.
Discret. Appl. Math., 2023
Generation and New Infinite Families of K<sub>2</sub>-hypohamiltonian Graphs.
CoRR, 2023
K<sub>2</sub>-Hamiltonian Graphs: II.
CoRR, 2023
Efficient Online Scheduling and Routing for Automated Guided Vehicles: Comparing a Novel Loop-Based Algorithm Against Existing Methods.
CoRR, 2023
On the Frank Number and Nowhere-Zero Flows on Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023
Critical (P<sub>5,dart)</sub>-Free Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2023
2022
The minimality of the Georges-Kelmans graph.
Math. Comput., 2022
Switching 3-edge-colorings of cubic graphs.
Discret. Math., 2022
New bounds for Ramsey numbers R(Kk-e, Kl-e).
Discret. Appl. Math., 2022
Few hamiltonian cycles in graphs with one or two vertex degrees.
CoRR, 2022
A heuristic algorithm for the maximum happy vertices problem using tree decompositions.
CoRR, 2022
An introduction to Computational Graph Theory and Generation Algorithms (invited paper).
Proceedings of the 22nd Conference Information Technologies, 2022
2021
<i>k</i>-Critical graphs in <i>P</i><sub>5</sub>-free graphs.
Theor. Comput. Sci., 2021
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path.
Theor. Comput. Sci., 2021
A unified approach to construct snarks with circular flow number 5.
J. Graph Theory, 2021
Some Results on k-Critical P<sub>5</sub>-Free Graphs.
CoRR, 2021
New bounds for Ramsey numbers R(K<sub>k</sub>-e, K<sub>l</sub>-e).
CoRR, 2021
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
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 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
