| Publication | Date of Publication | Type |
|---|
| The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs. | 2024-11-28 | Paper |
| Flip colouring of graphs | 2024-11-04 | Paper |
| Using Schur rings to produce GRRs for dihedral groups | 2024-10-28 | Paper |
| Flip colouring of graphs | 2023-12-14 | Paper |
| The Feasibility Problem -- the family ${\cal F}$$(G)$ of all induced $G$-free graphs | 2023-11-02 | Paper |
| The feasibility problem for line graphs | 2022-11-11 | Paper |
| On small balanceable, strongly-balanceable and omnitonal graphs | 2022-07-26 | Paper |
| Index of parameters of iterated line graphs | 2022-05-27 | Paper |
| On zero-sum spanning trees and zero-sum connectivity | 2022-02-01 | Paper |
| Preface: The second Malta conference in graph theory and combinatorics | 2021-05-19 | Paper |
| The construction of a smallest unstable asymmetric graph and a family of unstable asymmetric graphs with an arbitrarily high index of instability | 2021-05-19 | Paper |
| A note on totally-omnitonal graphs | 2020-07-10 | Paper |
| From Schur rings to constructive and analytical enumeration of circulant graphs with prime-cubed number of vertices | 2020-07-01 | Paper |
| Two short proofs of the Perfect Forest Theorem | 2019-07-22 | Paper |
| Notes on spreads of degrees in graphs | 2019-05-16 | Paper |
| Balanced centrality of networks | 2019-02-21 | Paper |
| Equating two maximum degrees | 2019-02-13 | Paper |
| Two-fold orbitals | 2017-06-13 | Paper |
| Degree monotone paths and graph operations | 2017-02-17 | Paper |
| Topics in graph automorphisms and reconstruction | 2016-06-20 | Paper |
| Selective hypergraph colourings | 2016-01-21 | Paper |
| Independence and Matchings in $\sigma$-hypergraphs | 2015-11-16 | Paper |
| Unstable graphs: a fresh outlook via TF-automorphisms | 2015-08-06 | Paper |
| Degree Monotone Paths | 2015-08-05 | Paper |
| The saturation number for the length of degree monotone paths | 2015-08-04 | Paper |
| \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs | 2015-04-28 | Paper |
| Constrained colouring and \(\sigma\)-hypergraphs | 2015-03-04 | Paper |
| A Generalisation of Isomorphisms with Applications | 2014-03-03 | Paper |
| Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs | 2014-01-27 | Paper |
| Coset graphs for low-density parity check codes: performance on the binary erasure channel | 2013-10-18 | Paper |
| On the edge-reconstruction number of disconnected graphs | 2012-10-06 | Paper |
| Links between two semisymmetric graphs on 112 vertices via association schemes | 2012-07-04 | Paper |
| Two-fold automorphisms of graphs | 2011-08-31 | Paper |
| Subgraphs as a measure of similarity | 2010-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5710205 | 2005-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461492 | 2005-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414312 | 2003-07-24 | Paper |
| Constructing graphs with several pseudosimilar vertices or edges | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4498317 | 2001-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4487459 | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940041 | 2000-03-01 | Paper |
| Large sets of pseudosimilar vertices | 1997-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288163 | 1994-06-07 | Paper |
| ON THE CLASS-RECONSTRUCTION NUMBER OF TREES | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3808123 | 1987-01-01 | Paper |
| The class reconstruction number of maximal planar graphs | 1987-01-01 | Paper |
| Edge‐reconstruction of planar graphs with minimum valency 5 | 1979-01-01 | Paper |
| Using Schur Rings to Produce GRRs for Dihedral Groups | N/A | Paper |
| Further Applications of Schur Rings to Produce GRRs for Dihedral Groups | N/A | Paper |
