An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences (Q5225547): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q129130847, #quickstatements; #temporary_batch_1723898920960 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1803.00673 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129130847 / rank | |||
Normal rank | |||
Latest revision as of 15:21, 17 August 2024
scientific article; zbMATH DE number 7084022
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences |
scientific article; zbMATH DE number 7084022 |
Statements
An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences (English)
0 references
22 July 2019
0 references
graphical degree sequence
0 references
graphical partition
0 references
forcibly connected
0 references
forcibly $k$-connected
0 references
co-NP
0 references
