-
Talk: Computing fixed point free automorphisms of graphs
-
Talk: A graph energy conjecture through the lenses of semidefinite programming
-
Talk: A graph energy conjecture through the lenses of semidefinite programming
-
Talk: A graph energy conjecture through the lenses of semidefinite programming
-
Talk: A graph energy conjecture through the lenses of semidefinite programming
-
Talk: A graph energy conjecture through the lenses of semidefinite programming
-
Talk: A graph energy conjecture through the lenses of semidefinite programming
-
-
-
Talk: Spectral upper bounds for the Grundy number of a graph
-
Talk: Computing Fixed Point Free Automorphisms of Graph Classes
-
Talk: Computing Fixed Point Free Automorphisms of Graph Classes
-
Talk: Grundy number and the matching polynomial
-
-
Lightning talk: Matching (Multi)Cut
-
Open problem section: Rainbow Stacking of Random Edge-Colorings
-
-
Talk: Forbidden structures in integral trees
-
Poster: Spectral bounds for the Grundy number
-
Talk: Quantum walks do not like bridges
-
Talk: Strongly Cospectral Vertices in Trees
-
Poster: Strongly Cospectral Vertices in Trees