Remarks on upper and lower bounds formatching sequencibility of graphs (Q5279493): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 20:46, 8 February 2024

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
    19 July 2017
    0 references
    matchings
    0 references
    matching sequencibility
    0 references
    matching number
    0 references
    $k$th power of a Hamilton path
    0 references

    Identifiers