Independence and matchings in σ-hypergraphs. - Yair Caro; Josef Lauri; Christina Zarb (Australas. J Comb., 2015)

(2, 2)-colourings and clique-free σ-hypergraphs. - Yair Caro; Josef Lauri; Christina Zarb (Discret. Appl. Math., 2015)

Constrained colouring and σ-hypergraphs. - Yair Caro; Josef Lauri; Christina Zarb (Discuss. Math. Graph Theory, 2015)

The saturation number for the length of degree monotone paths. - Yair Caro; Josef Lauri; Christina Zarb (Discuss. Math. Graph Theory, 2015)

Selective hypergraph colourings. - Yair Caro; Josef Lauri; Christina Zarb (Discret. Math., 2016)

Ramsey numbers for degree monotone paths. - Yair Caro; Raphael Yuster; Christina Zarb (Discret. Math., 2017)

Notes on spreads of degrees in graphs. - Yair Caro; Josef Lauri; Christina Zarb (Bull. ICA, 2019)

A note on totally-omnitonal graphs. - Yair Caro; Josef Lauri; Christina Zarb (Bull. ICA, 2020)

On Zero-Sum Spanning Trees and Zero-Sum Connectivity. - Yair Caro; Adriana Hansberg; Josef Lauri; Christina Zarb (Electron. J. Comb., 2022)

Index of parameters of iterated line graphs. - Yair Caro; Josef Lauri; Christina Zarb (Discret. Math., 2022)

On small balanceable, strongly-balanceable and omnitonal graphs. - Yair Caro; Josef Lauri; Christina Zarb (Discuss. Math. Graph Theory, 2022)

The feasibility problem for line graphs. - Yair Caro; Josef Lauri; Christina Zarb (Discret. Appl. Math., 2023)

Flip colouring of graphs. - Yair Caro; Josef Lauri; Xandru Mifsud; Raphael Yuster; Christina Zarb (Graphs Comb., 2024)