An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences (Q5225547): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 18:19, 8 February 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