An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences (Q4987152): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:42, 8 February 2024
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
