Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q122878797, #quickstatements; #temporary_batch_1714939311826
 
Property / Wikidata QID
 
Property / Wikidata QID: Q122878797 / rank
 
Normal rank

Latest revision as of 22:01, 5 May 2024

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