Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038)

From MaRDI portal
Revision as of 22:01, 5 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q122878797, #quickstatements; #temporary_batch_1714939311826)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7721325
Language Label Description Also known as
English
Partitioning \(P_4\)-tidy graphs into a stable set and a forest
scientific article; zbMATH DE number 7721325

    Statements

    Partitioning \(P_4\)-tidy graphs into a stable set and a forest (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 August 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    partition
    0 references
    \(P_4\)-tidy
    0 references
    stable set
    0 references
    acyclic set
    0 references
    near-bipartite
    0 references
    0 references