Restricted dualities for graphs

Patrice Ossona de Mendez

Abstract

A restricted duality for a class of graphs C is a pair (F,D) such that:

* F has no homomorphism to D

* for every graph G in C, F has no homomorphism to G if and only if G

has a homomorphism to D. We study which classes admit restricted dualities.