| Publication | Date of Publication | Type |
|---|
| Dataset for Exhaustive generation of edge-girth-regular graphs | 2025-01-08 | Dataset |
On graphs isomorphic with their conduction graph
MATCH - Communications in Mathematical and in Computer Chemistry | 2024-10-31 | Paper |
| Critical \((P_5,\mathit{dart})\)-free graphs | 2024-09-16 | Paper |
Few Hamiltonian cycles in graphs with one or two vertex degrees
Mathematics of Computation | 2024-08-21 | Paper |
Generation and new infinite families of \(K_2\)-hypohamiltonian graphs
Discrete Mathematics | 2024-05-21 | Paper |
K2‐Hamiltonian graphs: II
Journal of Graph Theory | 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
Journal of Graph Theory | 2023-09-29 | Paper |
A unified approach to construct snarks with circular flow number 5
Journal of Graph Theory | 2023-09-29 | Paper |
| Critical $(P_5,dart)$-Free Graphs | 2023-08-07 | Paper |
Some results on \(k\)-critical \(P_5\)-free graphs
Discrete Applied Mathematics | 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
Lecture Notes in Computer Science | 2023-03-30 | Paper |
Colouring graphs with no induced six-vertex path or diamond
Theoretical Computer Science | 2023-01-04 | Paper |
House of graphs 2.0: a database of interesting graphs and more
Discrete Applied Mathematics | 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
(available as arXiv preprint) | 2022-10-31 | Paper |
Switching 3-edge-colorings of cubic graphs
Discrete Mathematics | 2022-06-14 | Paper |
The minimality of the Georges-Kelmans graph
Mathematics of Computation | 2022-04-13 | Paper |
New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)
Discrete Applied Mathematics | 2021-12-07 | Paper |
Generation and properties of nut graphs
(available as arXiv preprint) | 2021-09-02 | Paper |
\(k\)-critical graphs in \(P_5\)-free graphs
Lecture Notes in Computer Science | 2021-04-21 | Paper |
| Dataset and code for Switching 3-edge-colorings of cubic graphs | 2021-04-21 | Dataset |
\(k\)-critical graphs in \(P_5\)-free graphs
Theoretical Computer Science | 2021-04-08 | Paper |
Structural and computational results on platypus graphs
Applied Mathematics and Computation | 2021-03-16 | Paper |
Better 3-coloring algorithms: excluding a triangle and a seven vertex path
Theoretical Computer Science | 2020-12-16 | Paper |
Large independent sets in triangle-free cubic graphs: beyond planarity
Advances in Combinatorics | 2020-10-20 | Paper |
Computational results and new bounds for the circular flow number of snarks
Discrete Mathematics | 2020-08-12 | Paper |
Computational results and new bounds for the circular flow number of snarks
Discrete Mathematics | 2020-08-12 | Paper |
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs
Journal of Graph Theory | 2020-07-17 | Paper |
On minimal triangle-free 6-chromatic graphs
Journal of Graph Theory | 2020-05-21 | Paper |
The smallest nontrivial snarks of oddness 4
Discrete Applied Mathematics | 2020-03-23 | Paper |
Obstructions for three-coloring and list three-coloring \(H\)-free graphs
SIAM Journal on Discrete Mathematics | 2020-02-20 | Paper |
Existence of regular nut graphs for degree at most 11
Discussiones Mathematicae Graph Theory | 2020-02-17 | Paper |
Obstructions for three-coloring graphs without induced paths on six vertices
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Graphs with few Hamiltonian cycles
Mathematics of Computation | 2019-12-27 | Paper |
On the minimum leaf number of cubic graphs
Discrete Mathematics | 2019-09-11 | Paper |
On almost hypohamiltonian graphs
(available as arXiv preprint) | 2019-08-01 | Paper |
| On almost hypohamiltonian graphs | 2019-08-01 | Paper |
Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
Ars Mathematica Contemporanea | 2019-07-25 | Paper |
Bounds for the smallest $k$-chromatic graphs of given girth
(available as arXiv preprint) | 2019-05-23 | Paper |
| Bounds for the smallest $k$-chromatic graphs of given girth | 2019-05-23 | Paper |
On hypohamiltonian snarks and a theorem of Fiorini
Ars Mathematica Contemporanea | 2018-08-03 | Paper |
Obstructions for three-coloring graphs with one forbidden induced subgraph
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Infinitely many planar cubic hypohamiltonian graphs of girth 5
Journal of Graph Theory | 2018-07-13 | Paper |
On the smallest snarks with oddness 4 and connectivity 2
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
On the smallest snarks with oddness 4 and connectivity 2
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
A note on 2-bisections of claw-free cubic graphs
Discrete Applied Mathematics | 2018-05-24 | Paper |
Improved bounds for hypo-Hamiltonian graphs
Ars Mathematica Contemporanea | 2018-02-26 | Paper |
Exhaustive generation of \(k\)-critical \(\mathcal{H}\)-free graphs
Journal of Graph Theory | 2018-02-23 | Paper |
Generation of cubic graphs and snarks with large girth
Journal of Graph Theory | 2017-09-26 | Paper |
Generation of cubic graphs and snarks with large girth
Journal of Graph Theory | 2017-09-26 | Paper |
Fullerenes with distant pentagons
(available as arXiv preprint) | 2017-07-19 | Paper |
Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Recursive generation of IPR fullerenes
Journal of Mathematical Chemistry | 2015-09-28 | Paper |
Recursive generation of IPR fullerenes
Journal of Mathematical Chemistry | 2015-09-28 | Paper |
A counterexample to the pseudo 2-factor isomorphic graph conjecture
Discrete Applied Mathematics | 2015-07-24 | Paper |
A counterexample to the pseudo 2-factor isomorphic graph conjecture
Discrete Applied Mathematics | 2015-07-24 | Paper |
Generation and properties of snarks
Journal of Combinatorial Theory. Series B | 2014-10-16 | Paper |
The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Generation of cubic graphs
(available as arXiv preprint) | 2014-03-25 | Paper |
| Generation of cubic graphs | 2014-03-25 | Paper |
Speeding up Martins' algorithm for multiple objective shortest path problems
4OR | 2014-03-24 | Paper |
Ramsey numbers \(R(K_3, G)\) for graphs of order 10
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Ramsey numbers \(R(K_3, G)\) for graphs of order 10
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
New computational upper bounds for Ramsey numbers \(R(3,k)\)
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
New computational upper bounds for Ramsey numbers \(R(3,k)\)
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
House of Graphs: a database of interesting graphs
Discrete Applied Mathematics | 2012-11-22 | Paper |
Generation and New Infinite Families of $K_2$-hypohamiltonian Graphs
(available as arXiv preprint) | N/A | Paper |
HIST-Critical Graphs and Malkevitch's Conjecture
(available as arXiv preprint) | N/A | Paper |
Exhaustive generation of edge-girth-regular graphs
(available as arXiv preprint) | N/A | Paper |
Non-double covered cubic graphs
(available as arXiv preprint) | N/A | Paper |
Some Results on Critical ($P_5,H$)-free Graphs
(available as arXiv preprint) | N/A | Paper |
Minimal obstructions to $C_5$-coloring in hereditary graph classes
(available as arXiv preprint) | N/A | Paper |
