Induced Saturation For Paths
22 May 2020A graph \(G\) is said to be induced saturated for \(H\) if \(G\) contains no induced copy of \(H\), but adding or removing any edge creates an induced copy. We give some graphs which are induced saturated for \(P_5\).