On forcibly connected graphic sequences (Q1185077): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The strongest monotone degree condition for \(n\)-connectedness of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5576241 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4071777 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3929766 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4148014 / rank | |||
Normal rank |
Revision as of 17:17, 15 May 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