Knocking out \(P_k\)-free graphs (Q2352787)

From MaRDI portal
Revision as of 06:50, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Knocking out \(P_k\)-free graphs
scientific article

    Statements

    title
    Knocking out \(P_k\)-free graphs (English)
    0 references
    author
    Matthew Johnson
    0 references
    Daniël Paulusma
    0 references
    Anthony Stewart
    0 references
    publication date
    6 July 2015
    0 references
    zbMATH Keywords
    parallel knock-out schemes
    0 references
    Hamilton cycle
    0 references
    cographs
    0 references
    split graphs
    0 references
    computational complexity
    0 references

    Identifiers

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