Highly Influenced

4 Excerpts

- Published 1986 in Journal of Graph Theory

Let F = {F,, . . .} be a given class of forbidden graphs. A graph G is called F-saturated if no F, E F is a subgraph of G but the addition of an arbitrary new edge gives a forbidden subgraph. In this paper the minimal number of edges in F-saturated graphs is examined. General estimations are given and the structure of minimal graphs is described for some special forbidden graphs (stars, paths, rn pairwise disjoint edges).

@article{Kszonyi1986SaturatedGW,
title={Saturated graphs with minimal number of edges},
author={L. K{\'a}szonyi and Zsolt Tuza},
journal={Journal of Graph Theory},
year={1986},
volume={10},
pages={203-210}
}