An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences (Q5225547)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences |
scientific article; zbMATH DE number 7084022
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9268452525138856
0 references
0.7975029349327087
0 references
0.7953460812568665
0 references
0.7948986887931824
0 references
