An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences (Q4987152)
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 Potential Bipartiteness of Graphical Degree Sequences |
scientific article; zbMATH DE number 7341077
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences |
scientific article; zbMATH DE number 7341077 |
Statements
An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences (English)
0 references
28 April 2021
0 references
graphical degree sequence
0 references
bipartite realization
0 references
