Note on 3-Coloring of (2P4, C5)-Free Graphs. - Vít Jelínek; Tereza Klimosová; Tomás Masarík; Jana Novotná 001; Aneta Pokorná (CoRR, 2020)

Constructions of betweenness-uniform graphs from trees. - David Hartman; Aneta Pokorná (CoRR, 2021)

On Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture. - Patrick Hompe; Petra Pelikánová; Aneta Pokorná; Sophie Spirkl (Discret. Math., 2021)

On 3-Coloring of (2P4, C5)-Free Graphs. - Vít Jelínek; Tereza Klimosová; Tomás Masarík; Jana Novotná 001; Aneta Pokorná (Algorithmica, 2022)

Computing approximate symmetries of complex networks. - Anna Pidnebesna; David Hartman; Aneta Pokorná; Matej Straka; Jaroslav Hlinka (CoRR, 2023)

On the connectivity and the diameter of betweenness-uniform graphs. - David Hartman; Aneta Pokorná; Pavel Valtr 001 (Discret. Appl. Math., 2024)