Charles Explorer logo
🇬🇧

Colored graphs without colorful cycles

Publication at Faculty of Mathematics and Physics |
2007

Abstract

Two characterizations of exact Gallai graphs are presented, one of them in terms of reduced forms, another by means of a duality in full homomorphisms (this second one, hence, in fact consists of two characteristics, one of them by forbidden subgraphs, the other by a constraint satisfaction).