Finding maximum square-free 2-matchings in bipartite graphs (Q2498740)

From MaRDI portal
Revision as of 08:48, 5 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding maximum square-free 2-matchings in bipartite graphs
scientific article

    Statements

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

    Identifiers

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