An embedding of a graph in a surface gives rise to a combinatorial design whose blocks
correspond to the faces of the embedding. Particularly interesting graphs include complete …

Excluding induced subgraphs Page 108 Excluding induced subgraphs 1 Maria Chudnovsky and
Paul Seymour Abstract In this paper we survey some results concerning the structure and …

We enumerate all possible trades which involve up to six faces of the face set of a triangular
embedding of a simple connected graph. These are classified by the underlying …

Résumé De nombreux problèmes pratiques peuvent être modélisés par la coloration des
sommets d'un graphe. C'est pourquoi, elle a connu un assez grand engouement ces …

The distance d (f, f′) between two triangular embeddings f and f′ of a complete graph is
the minimal number t such that we can replace t faces in f by t new faces to obtain a …