Saturated graphs with minimal number of edges

Abstract

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).

DOI: 10.1002/jgt.3190100209

2 Figures and Tables

Statistics

051015'98'00'02'04'06'08'10'12'14'16
Citations per Year

84 Citations

Semantic Scholar estimates that this publication has 84 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@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} }