5 citations · 5 across the 8 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Almost Linear 3-Spanners of Temporal Cliques
Julia Baligacs, Davide Bilò, Václav Blažej +2
Temporal graphs model dynamic networks by assigning positive integer time labels to the edges, while information propagates along temporal paths, whose edge labels are traversed in…
math.CO2026
Well-quasi-ordered classes of bounded clique-width
Maël Dumas, Aliaume Lopez
We study classes of graphs with bounded clique-width that are well-quasi-ordered by the induced subgraph relation, in the presence of labels on the vertices. We prove that, given a…