Graph saturation in multipartite graphs
Graph saturation in multipartite graphs
Let G be a fixed graph and let F be a family of graphs. A subgraph J of G is F-saturated if no member of F is a subgraph of J, but for any edge e in E(G)−E(J), some element of F is a subgraph of J + e. We …