On forcibly connected graphic sequences (Q1185077): Difference between revisions

Let \(p\) be a graph-theoretic property. A graphic sequence \(\pi: d_ 1\geq d_ 2\geq \dots\geq d_ p\) is forcibly \(p\) if every realization of \(\pi\) has property \(p\). The author gives a few sufficient conditions for a graphic sequence to be forcibly connected.