A two-connected planar graph without concurrent longest paths (Q2554342)

From MaRDI portal
Revision as of 06:27, 15 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q481028)
scientific article
Language Label Description Also known as
English
A two-connected planar graph without concurrent longest paths
scientific article

    Statements

    title
    A two-connected planar graph without concurrent longest paths (English)
    0 references
    publication date
    1972
    0 references

    Identifiers

    zbMATH DE Number
    3384051
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2554342&oldid=21306153"
    Powered by MediaWiki