Josef Lauri

Discret. Appl. Math., 2023

2022

On small balanceable, strongly-balanceable and omnitonal graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

Index of parameters of iterated line graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

On Zero-Sum Spanning Trees and Zero-Sum Connectivity.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2020

A note on totally-omnitonal graphs.

[BibT_eX]

[DOI]

Bull. ICA, 2020

2019

Preface: The Second Malta Conference in Graph Theory and Combinatorics.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

The construction of a smallest unstable asymmetric graph and a family of unstable asymmetric graphs with an arbitrarily high index of instability.

[BibT_eX]

[DOI]

Russell Mizzi

Raffaele Scapellato

Discret. Appl. Math., 2019

Notes on spreads of degrees in graphs.

[BibT_eX]

[DOI]

Bull. ICA, 2019

2016

Selective hypergraph colourings.

[BibT_eX]

[DOI]

Discret. Math., 2016

2015

The saturation number for the length of degree monotone paths.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

Constrained colouring and σ-hypergraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

(2, 2)-colourings and clique-free σ-hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Unstable graphs: A fresh outlook via TF-automorphisms.

[BibT_eX]

[DOI]

Russell Mizzi

Raffaele Scapellato

Ars Math. Contemp., 2015

Independence and matchings in σ-hypergraphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2015

2014

Non-monochromatic non-rainbow colourings of σ-hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

On the edge-reconstruction number of a tree.

[BibT_eX]

[DOI]

Australas. J Comb., 2014

2012

Links between two semisymmetric graphs on 112 vertices via association schemes.

[BibT_eX]

[DOI]

Mikhail H. Klin

Matan Ziv-Av

J. Symb. Comput., 2012

2011

Coset graphs for low-density parity check codes: performance on the binary erasure channel.

[BibT_eX]

[DOI]

Cen Jung Tjhai

IET Commun., 2011

Two-fold automorphisms of graphs.

[BibT_eX]

[DOI]

Russell Mizzi

Raffaele Scapellato

Australas. J Comb., 2011

Subgraphs as a Measure of Similarity.

[BibT_eX]

[DOI]

Proceedings of the Structural Analysis of Complex Networks, 2011

2010

A survey of some open questions in reconstruction numbers.

[BibT_eX]

Ars Comb., 2010

2003

Constructing graphs with several pseudosimilar vertices or edges.

[BibT_eX]

[DOI]

Discret. Math., 2003

Graph Representation.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Graph Theory., 2003

2002

On Disconnected Graph with Large Reconstruction Number.

[BibT_eX]

Kevin J. Asciak

Ars Comb., 2002

1997

On a formula for the number of Euler trails for a class of digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Pseudosimilarity in Graphs - A Survey.

[BibT_eX]

Ars Comb., 1997

1996

Large sets of pseudosimilar vertices.

[BibT_eX]

[DOI]

Discret. Math., 1996

1994

Preface.

[BibT_eX]

[DOI]

Stanley Fiorini

Discret. Math., 1994

1987

The class reconstruction number of maximal planar graphs.

[BibT_eX]

[DOI]

Frank Harary

Graphs Comb., 1987

1983

Proof of Harary's conjecture on the reconstruction of trees.

[BibT_eX]

[DOI]

Discret. Math., 1983

1982

Edge-reconstruction of 4-connected planar graphs.

[BibT_eX]

[DOI]

Stanley Fiorini

J. Graph Theory, 1982

1981

The reconstruction of maximal planar graphs II. Reconstruction.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1981

The reconstruction of maximal planar graphs. I. Recognition.

[BibT_eX]

[DOI]

Stanley Fiorini

J. Comb. Theory B, 1981

1979

Edge-reconstruction of planar graphs with minimum valency 5.

[BibT_eX]

[DOI]