Maximising the number of induced cycles in a graph (Q2399349)

From MaRDI portal
Revision as of 10:27, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Maximising the number of induced cycles in a graph
scientific article

    Statements

    title
    Maximising the number of induced cycles in a graph (English)
    0 references
    author
    Natasha Morrison
    0 references
    Alexander D. Scott
    0 references
    publication date
    22 August 2017
    0 references
    zbMATH Keywords
    induced subgraphs
    0 references
    holes
    0 references
    inducibility
    0 references

    Identifiers

    zbMATH DE Number
    6763481
    0 references
    OpenAlex ID
    W2963666924
    0 references
    arXiv ID
    1603.02960
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2399349&oldid=39059539"
    Powered by MediaWiki