Showing cs.DMShow all
2 papers · 1 filter
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…
cs.DM2025
Splitting vertices of bipartite graphs preserves de Bruijn-ErdÅs property
Laurent Beaudou, Guillermo Gamboa Quintero
In this note, we prove that every graph obtained from a bipartite graph by iteratively splitting vertices into two adjacent twins has the de Bruijn-ErdÅs property.