Morphism-driven design of graph colouring institutions ?
Giuseppe Scollo · 2003
Maximal planar graphs with vertex resp. edge colouring are naturally casted as (deceiptively similar) institutions. One then tries to embody Tait's equivalence algorithms into morphisms between them, and is lead to a partial redesign of those institutions. This paper aims at elucidating the pragmatic questions which arise in this case study, which also showcases the use of relational concepts and notations in the design of the subject institutions, that is driven by the design of an isomorphism between them.