| Publication | Date of Publication | Type |
|---|
The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs.
The Australasian Journal of Combinatorics | 2024-11-28 | Paper |
Flip colouring of graphs
Graphs and Combinatorics | 2024-11-04 | Paper |
Using Schur rings to produce GRRs for dihedral groups
Utilitas Mathematica | 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
Discrete Applied Mathematics | 2022-11-11 | Paper |
On small balanceable, strongly-balanceable and omnitonal graphs
Discussiones Mathematicae Graph Theory | 2022-07-26 | Paper |
Index of parameters of iterated line graphs
Discrete Mathematics | 2022-05-27 | Paper |
On zero-sum spanning trees and zero-sum connectivity
The Electronic Journal of Combinatorics | 2022-02-01 | Paper |
Preface: The second Malta conference in graph theory and combinatorics
Discrete Applied Mathematics | 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
Discrete Applied Mathematics | 2021-05-19 | Paper |
A note on totally-omnitonal graphs
(available as arXiv preprint) | 2020-07-10 | 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
Springer Proceedings in Mathematics & Statistics | 2020-07-01 | Paper |
Two short proofs of the Perfect Forest Theorem
Theory and Applications of Graphs | 2019-07-22 | Paper |
Notes on spreads of degrees in graphs
(available as arXiv preprint) | 2019-05-16 | Paper |
Balanced centrality of networks
International Scholarly Research Notices. Discrete Mathematics | 2019-02-21 | Paper |
| Equating two maximum degrees | 2019-02-13 | Paper |
Equating two maximum degrees
(available as arXiv preprint) | 2019-02-13 | Paper |
| Two-fold orbitals | 2017-06-13 | Paper |
Degree monotone paths and graph operations
(available as arXiv preprint) | 2017-02-17 | Paper |
Topics in graph automorphisms and reconstruction
London Mathematical Society Lecture Note Series | 2016-06-20 | Paper |
Selective hypergraph colourings
Discrete Mathematics | 2016-01-21 | Paper |
| Independence and Matchings in $\sigma$-hypergraphs | 2015-11-16 | Paper |
Independence and Matchings in $\sigma$-hypergraphs
(available as arXiv preprint) | 2015-11-16 | Paper |
Unstable graphs: a fresh outlook via TF-automorphisms
Ars Mathematica Contemporanea | 2015-08-06 | Paper |
Degree Monotone Paths
(available as arXiv preprint) | 2015-08-05 | Paper |
The saturation number for the length of degree monotone paths
Discussiones Mathematicae Graph Theory | 2015-08-04 | Paper |
\((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs
Discrete Applied Mathematics | 2015-04-28 | Paper |
Constrained colouring and \(\sigma\)-hypergraphs
Discussiones Mathematicae Graph Theory | 2015-03-04 | Paper |
| A Generalisation of Isomorphisms with Applications | 2014-03-03 | Paper |
Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs
Discrete Mathematics | 2014-01-27 | Paper |
Coset graphs for low-density parity check codes: performance on the binary erasure channel
IET Communications | 2013-10-18 | Paper |
On the edge-reconstruction number of disconnected graphs
Bulletin of the Institute of Combinatorics and its Applications | 2012-10-06 | Paper |
Links between two semisymmetric graphs on 112 vertices via association schemes
Journal of Symbolic Computation | 2012-07-04 | Paper |
| Two-fold automorphisms of graphs | 2011-08-31 | Paper |
Subgraphs as a measure of similarity
Structural Analysis of Complex Networks | 2010-12-21 | Paper |
| scientific article; zbMATH DE number 2234827 (Why is no real title available?) | 2005-12-02 | Paper |
| scientific article; zbMATH DE number 2188393 (Why is no real title available?) | 2005-07-26 | Paper |
| scientific article; zbMATH DE number 1952951 (Why is no real title available?) | 2003-07-24 | Paper |
Constructing graphs with several pseudosimilar vertices or edges
Discrete Mathematics | 2003-06-25 | Paper |
| scientific article; zbMATH DE number 1491626 (Why is no real title available?) | 2001-04-26 | Paper |
| scientific article; zbMATH DE number 1463400 (Why is no real title available?) | 2000-12-03 | Paper |
| scientific article; zbMATH DE number 1409202 (Why is no real title available?) | 2000-03-01 | Paper |
Large sets of pseudosimilar vertices
Discrete Mathematics | 1997-05-04 | Paper |
| scientific article; zbMATH DE number 554170 (Why is no real title available?) | 1994-06-07 | Paper |
ON THE CLASS-RECONSTRUCTION NUMBER OF TREES
The Quarterly Journal of Mathematics | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4077274 (Why is no real title available?) | 1987-01-01 | Paper |
The class reconstruction number of maximal planar graphs
Graphs and Combinatorics | 1987-01-01 | Paper |
Edge‐reconstruction of planar graphs with minimum valency 5
Journal of Graph Theory | 1979-01-01 | Paper |
Using Schur Rings to Produce GRRs for Dihedral Groups
(available as arXiv preprint) | N/A | Paper |
Further Applications of Schur Rings to Produce GRRs for Dihedral Groups
(available as arXiv preprint) | N/A | Paper |
