| Publication | Date of Publication | Type |
|---|
| K2‐Hamiltonian graphs: II | 2024-02-23 | Paper |
| The maximum number of connected sets in regular graphs | 2023-10-31 | Paper |
| A unified approach to construct snarks with circular flow number 5 | 2023-09-29 | Paper |
| Critical $(P_5,dart)$-Free Graphs | 2023-08-07 | Paper |
| Some results on \(k\)-critical \(P_5\)-free graphs | 2023-05-11 | Paper |
| Frank number and nowhere-zero flows on graphs | 2023-05-03 | Paper |
| Exact enumeration of fullerenes | 2023-04-04 | Paper |
| Colouring graphs with no induced six-vertex path or diamond | 2023-03-30 | Paper |
| Colouring graphs with no induced six-vertex path or diamond | 2023-01-04 | Paper |
| House of graphs 2.0: a database of interesting graphs and more | 2022-12-08 | Paper |
| Few hamiltonian cycles in graphs with one or two vertex degrees | 2022-11-15 | Paper |
| House of Graphs 2.0: a database of interesting graphs and more | 2022-10-31 | Paper |
| Switching 3-edge-colorings of cubic graphs | 2022-06-14 | Paper |
| The minimality of the Georges–Kelmans graph | 2022-04-13 | Paper |
| New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\) | 2021-12-07 | Paper |
| Generation and properties of nut graphs | 2021-09-02 | Paper |
| \(k\)-critical graphs in \(P_5\)-free graphs | 2021-04-21 | Paper |
| \(k\)-critical graphs in \(P_5\)-free graphs | 2021-04-08 | Paper |
| Structural and computational results on platypus graphs | 2021-03-16 | Paper |
| Better 3-coloring algorithms: excluding a triangle and a seven vertex path | 2020-12-16 | Paper |
| Large independent sets in triangle-free cubic graphs: beyond planarity | 2020-10-20 | Paper |
| Computational results and new bounds for the circular flow number of snarks | 2020-08-12 | Paper |
| Colourings of cubic graphs inducing isomorphic monochromatic subgraphs | 2020-07-17 | Paper |
| On minimal triangle‐free 6‐chromatic graphs | 2020-05-21 | Paper |
| The smallest nontrivial snarks of oddness 4 | 2020-03-23 | Paper |
| Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs | 2020-02-20 | Paper |
| Existence of regular nut graphs for degree at most 11 | 2020-02-17 | Paper |
| Obstructions for three-coloring graphs without induced paths on six vertices | 2020-01-15 | Paper |
| Graphs with few hamiltonian cycles | 2019-12-27 | Paper |
| On the minimum leaf number of cubic graphs | 2019-09-11 | Paper |
| On almost hypohamiltonian graphs | 2019-08-01 | Paper |
| Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 | 2019-07-25 | Paper |
| Bounds for the smallest $k$-chromatic graphs of given girth | 2019-05-23 | Paper |
| On hypohamiltonian snarks and a theorem of Fiorini | 2018-08-03 | Paper |
| Obstructions for three-coloring graphs with one forbidden induced subgraph | 2018-07-16 | Paper |
| Infinitely many planar cubic hypohamiltonian graphs of girth 5 | 2018-07-13 | Paper |
| On the smallest snarks with oddness 4 and connectivity 2 | 2018-05-25 | Paper |
| A note on 2-bisections of claw-free cubic graphs | 2018-05-24 | Paper |
| Improved bounds for hypohamiltonian graphs | 2018-02-26 | Paper |
| Exhaustive generation of k‐critical ‐free graphs | 2018-02-23 | Paper |
| Generation of Cubic Graphs and Snarks with Large Girth | 2017-09-26 | Paper |
| Fullerenes with distant pentagons | 2017-07-19 | Paper |
| Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs | 2016-12-22 | Paper |
| Recursive generation of IPR fullerenes | 2015-09-28 | Paper |
| A counterexample to the pseudo 2-factor isomorphic graph conjecture | 2015-07-24 | Paper |
| Generation and properties of snarks | 2014-10-16 | Paper |
| The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\) | 2014-08-14 | Paper |
| The Generation of Fullerenes | 2014-03-25 | Paper |
| Speeding up Martins' algorithm for multiple objective shortest path problems | 2014-03-24 | Paper |
| Ramsey numbers \(R(K_3, G)\) for graphs of order 10 | 2013-06-07 | Paper |
| New computational upper bounds for Ramsey numbers \(R(3,k)\) | 2013-06-07 | Paper |
| House of Graphs: a database of interesting graphs | 2012-11-22 | Paper |
