Terminal-Pairability in Complete Graphs (Q3119338)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Terminal-Pairability in Complete Graphs
scientific article

    Statements

    author
    Tamás Róbert Mezei
    0 references
    Gábor Mészáros
    0 references
    Ervin Gyoeri
    0 references
    publication date
    11 March 2019
    0 references
    arXiv classification
    math.CO
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C38
    0 references
    05C35
    0 references
    90B18
    0 references
    zbMATH DE Number
    7034408
    0 references
    arXiv ID
    1605.05857
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3119338&oldid=33620055"
    Powered by MediaWiki