On First-Order Definable Colorings

Jaroslav Nesetril (1) , Patrice Ossona de Mendez (1, 2)

1 IUUK - Computer Science Institute of Charles University [Prague]
2 CAMS - Centre d'Analyse et de Mathématique sociales

We address the problem of characterizing $H$-coloring problems that are first-order definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of structure.

Keywords: graph; coloring; first-order logic; bounded expansion class

Domains: Combinatorics [math.CO]

Jaroslav Nesetril, Patrice Ossona de Mendez. On First-Order Definable Colorings. 2014. ⟨hal-00957088v2⟩