Exponential families of minimally non-coordinated graphs

a graph g is coordinated if, for every induced subgraph h of g, the minimum number of colors that can be assigned to the cliques of h in such a way that no two cliques with non-empty intersection receive the same color is equal to the maximum number of cliques of h with a common vertex. in a previous work, coordinated graphs were characterized by minimal forbidden induced subgraphs within some classes of graphs. in this note, we present families of minimally non-coordinated graphs whose cardinality grows exponentially on the number of vertices and edges. furthermore, we describe some ideas to generate similar families. based on these results, it seems difficult to find a general characterization of coordinated graphs by minimal forbidden induced subgraphs.