Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...
On March 15, intriguing seminar announcements sent rumblings through the field of combinatorics, the mathematical study of counting. Three collaborators planned to give coordinated talks the following ...
On Tuesday the 3rd of October 2023, M.Sc. Manuel Cáceres defends his PhD thesis on Parameterized and Safe & Complete Graph Algorithms for Bioinformatics. The thesis is related to research done in the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results