11 citations · 44 across the 21 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
math.CO2025
Totally odd immersions of complete graphs in graph products
Henry Echeverría, Andrea Jiménez, Suchismita Mishra +2
For a graph , let denote the maximum integer such that contains as an immersion. A recent paper of Collins, Heenehan, and McDonald (2023) studied the behav…
cs.DM2025
Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
Laurent Beaudou, Jan Bok, Florent Foucaud +2
The \emph{-neighbourhood complexity} of a graph is the function counting, for a given integer , the largest possible number, over all vertex-subsets of size , of s…