An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences (Q5225547): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962787338 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1803.00673 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:09, 20 April 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
