×

\(P_m\)-saturated bipartite graphs with minimum size. (English) Zbl 1063.05072

A graph \(G\) is \(H\)-saturated if \(G\) is \(H\)-free and adding any new edge to \(G\) creates a copy of \(H\). The authors present some results in finding \(P_m\)-saturated bipartite graphs with minimum size, where \(P_m\) denotes the path of order \(m\).

MSC:

05C35 Extremal problems in graph theory
PDFBibTeX XMLCite
Full Text: DOI