Dudek, Aneta; Wojda, A. Paweł \(P_m\)-saturated bipartite graphs with minimum size. (English) Zbl 1063.05072 Discuss. Math., Graph Theory 24, No. 2, 197-211 (2004). 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\). Reviewer: Hang Tong Lau (Montréal) Cited in 3 Documents MSC: 05C35 Extremal problems in graph theory Keywords:saturated graph; extremal graph; bipartite graph PDFBibTeX XMLCite \textit{A. Dudek} and \textit{A. P. Wojda}, Discuss. Math., Graph Theory 24, No. 2, 197--211 (2004; Zbl 1063.05072) Full Text: DOI