A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic (Q4898764): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10587-012-0051-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086271872 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A remark on the existence of finite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Potentially K m — G-graphical sequences: A survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Rao-type characterization for a sequence to have a realization containing a split graph / rank | |||
Normal rank | |||
Latest revision as of 00:56, 6 July 2024
scientific article; zbMATH DE number 6121221
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic |
scientific article; zbMATH DE number 6121221 |
Statements
A Havel-Hakimi type procedure and a sufficient condition for a sequence to be potentially S r,s -graphic (English)
0 references
2 January 2013
0 references
split graph
0 references
degree sequence
0 references
