Remarks on upper and lower bounds formatching sequencibility of graphs (Q5279493)

From MaRDI portal
Revision as of 21:46, 8 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 6749863
Language Label Description Also known as
English
Remarks on upper and lower bounds formatching sequencibility of graphs
scientific article; zbMATH DE number 6749863

    Statements

    Remarks on upper and lower bounds formatching sequencibility of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 July 2017
    0 references
    0 references
    matchings
    0 references
    matching sequencibility
    0 references
    matching number
    0 references
    $k$th power of a Hamilton path
    0 references