An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> (Q4068762)

From MaRDI portal
Revision as of 15:05, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i>
scientific article

    Statements

    An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> (English)
    0 references
    0 references
    0 references
    1975
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references