| THE MINIMALITY OF THE GEORGES-KELMANS GRAPH | 0 | 0.34 | 2022 |
| Colouring Graphs with No Induced Six-Vertex Path or Diamond | 0 | 0.34 | 2021 |
| Better 3-Coloring Algorithms: Excluding A Triangle And A Seven Vertex Path | 0 | 0.34 | 2021 |
| k-Critical Graphs in P5-Free Graphs. | 0 | 0.34 | 2020 |
| On minimal triangle‐free 6‐chromatic graphs | 0 | 0.34 | 2020 |
| Computational results and new bounds for the circular flow number of snarks | 0 | 0.34 | 2020 |
| Existence of regular nut graphs for degree at most 11. | 0 | 0.34 | 2020 |
| Graphs with few Hamiltonian cycles | 2 | 0.45 | 2020 |
| On almost hypohamiltonian graphs. | 0 | 0.34 | 2019 |
| The smallest nontrivial snarks of oddness 4. | 0 | 0.34 | 2019 |
| Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44. | 0 | 0.34 | 2019 |
| A note on 2-bisections of claw-free cubic graphs. | 1 | 0.48 | 2018 |
| Infinitely many planar cubic hypohamiltonian graphs of girth 5. | 0 | 0.34 | 2018 |
| On the smallest snarks with oddness 4 and connectivity 2. | 1 | 0.36 | 2018 |
| On Hypohamiltonian Snarks and a Theorem of Fiorini. | 1 | 0.39 | 2018 |
| A Unified Approach To Construct Snarks With Circular Flow Number 5 | 0 | 0.34 | 2018 |
| On the minimum leaf number of cubic graphs. | 0 | 0.34 | 2018 |
| Bounds for the smallest k-chromatic graphs of given girth. | 0 | 0.34 | 2018 |
| Improved bounds for hypohamiltonian graphs. | 4 | 0.67 | 2017 |
| Colourings of cubic graphs inducing isomorphic monochromatic subgraphs | 0 | 0.34 | 2017 |
| OBSTRUCTIONS FOR THREE-COLORING AND LIST THREE-COLORING H-FREE GRAPHS | 1 | 0.36 | 2017 |
| On minimal triangle-free 6-chromatic graphs. | 1 | 0.41 | 2017 |
| Structural and computational results on platypus graphs | 0 | 0.34 | 2017 |
| Generation and properties of nut graphs. | 0 | 0.34 | 2017 |
| Exhaustive Generation of k-Critical ℋ-Free Graphs. | 0 | 0.34 | 2016 |
| Obstructions for three-coloring graphs with one forbidden induced subgraph. | 3 | 0.43 | 2016 |
| New results on hypohamiltonian and almost hypohamiltonian graphs. | 2 | 0.44 | 2016 |
| Fullerenes with distant pentagons | 1 | 0.41 | 2015 |
| Exhaustive generation of $k$-critical $\mathcal H$-free graphs | 0 | 0.34 | 2015 |
| Generation and properties of snarks. | 33 | 1.89 | 2013 |
| New Computational Upper Bounds for Ramsey Numbers R(3,k) | 8 | 0.82 | 2013 |
| Speeding up Martins' algorithm for multiple objective shortest path problems. | 6 | 0.47 | 2013 |
| The Ramsey Number $R(3, K_{10}-e)$ and Computational Bounds for $R(3, G)$. | 1 | 0.37 | 2013 |
| House of Graphs: a database of interesting graphs | 13 | 1.11 | 2013 |
| A Database of Interesting Graphs: The House of Graphs. | 0 | 0.34 | 2012 |
| Ramsey numbers R(K3,G) for graphs of order 10 | 3 | 0.45 | 2012 |
| The Generation of Fullerenes. | 12 | 1.22 | 2012 |
| Generation of Cubic graphs. | 4 | 0.56 | 2011 |
