4 papers
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…
Full-homomorphisms to paths and cycles
Santiago Guzmán-Pro
A full-homomorphism between a pair of graphs is a vertex mapping that preserves adjacencies and non-adjacencies. For a fixed graph , a full -colouring is a full-homomorphism…
Describing hereditary properties by forbidden circular orderings
Santiago Guzmán-Pro, Pavol Hell, César Hernández-Cruz
Each hereditary property can be characterized by its set of minimal obstructions; these sets are often unknown, or known but infinite. By allowing extra structure it is sometimes p…
Oriented expressions of graph properties
Santiago Guzmán-Pro, César Hernández-Cruz
Several graph properties are characterized as the class of graphs that admit an orientation avoiding finitely many oriented structures. For instance, if is the set of homomor…