On forcibly connected graphic sequences (Q1185077): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:15, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On forcibly connected graphic sequences |
scientific article |
Statements
On forcibly connected graphic sequences (English)
0 references
28 June 1992
0 references
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.
0 references
graphic sequences
0 references
connectivity
0 references
Hamiltonian graph
0 references