3 papers
cs.DM2025
A CSP approach to Graph Sandwich Problems
Manuel Bodirsky, Santiago Guzmán-Pro
The \emph{Sandwich Problem} (SP) for a graph class $\calC$ is the following computational problem. The input is a pair of graphs and where , a…
math.CO2024
The Generic Circular Triangle-Free Graph
Manuel Bodirsky, Santiago Guzmán-Pro
In this paper, we introduce the generic circular triangle-free graph and propose a finite axiomatization of its first order theory. In particular, our main results sh…
math.CO2024
Local expressions of hereditary classes
Santiago Guzmán-Pro
A well-established research line in structural and algorithmic graph theory is characterizing graph classes by listing their minimal obstructions. When this list is finite for some…