11 citations · 32 across the 32 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DS2022★ 4 cited
Optimal Adjacency Labels for Subgraphs of Cartesian Products
Louis Esperet, Nathaniel Harms, Viktor Zamaraev
For any hereditary graph class , we construct optimal adjacency labeling schemes for the classes of subgraphs and induced subgraphs of Cartesian products of graphs in . As a…
cs.DM2022
Giant Components in Random Temporal Graphs
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi +4
A temporal graph is a graph whose edges appear only at certain points in time. Recently, the second and the last three authors proposed a natural temporal analog of the Erdős-Rényi…
math.CO2022★ 2 cited
The treewidth and pathwidth of graph unions
Bogdan Alecu, Vadim Lozin, Daniel A. Quiroz +3
Given two -vertex graphs and of bounded treewidth, is there an -vertex graph of bounded treewidth having subgraphs isomorphic to and ? Our main res…