An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences (Q4987152)

From MaRDI portal
Revision as of 08:52, 14 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    graphical degree sequence
    0 references
    bipartite realization
    0 references