Generalized Majority Colourings of Digraphs. - António Girão; Teeradej Kittipassorn; Kamil Popielarz (Comb. Probab. Comput., 2017)

A stability theorem for maximal Kr+1-free graphs. - Kamil Popielarz; Julian Sahasrabudhe; Richard Snyder (J. Comb. Theory B, 2018)

Large Induced Subgraphs with k Vertices of Almost Maximum Degree. - António Girão; Kamil Popielarz (SIAM J. Discret. Math., 2018)

On the Maximum Degree of Path-Pairable Planar Graphs. - António Girão; Gábor Mészáros; Kamil Popielarz; Richard Snyder (Electron. J. Comb., 2019)

On the Maximum Diameter of Path-Pairable Graphs. - António Girão; Kamil Popielarz; Gábor Mészáros; Richard Snyder (Graphs Comb., 2019)

Partite Saturation of Complete Graphs. - António Girão; Teeradej Kittipassorn; Kamil Popielarz (SIAM J. Discret. Math., 2019)

Rainbow saturation of graphs. - António Girão; David Lewis; Kamil Popielarz (J. Graph Theory, 2020)

(2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked. - António Girão; Kamil Popielarz; Richard Snyder (Comb., 2021)

Subdivisions of digraphs in tournaments. - António Girão; Kamil Popielarz; Richard Snyder (J. Comb. Theory B, 2021)