Finding maximum square-free 2-matchings in bipartite graphs (Q2498740): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1103513
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: David B. Hartvigsen / rank
 
Normal rank

Revision as of 01:29, 22 February 2024

scientific article
Language Label Description Also known as
English
Finding maximum square-free 2-matchings in bipartite graphs
scientific article

    Statements

    Finding maximum square-free 2-matchings in bipartite graphs (English)
    0 references
    16 August 2006
    0 references
    matchings
    0 references
    Hamilton cycles
    0 references

    Identifiers