Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769)

From MaRDI portal
Revision as of 18:49, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article; zbMATH DE number 6813545
Language Label Description Also known as
English
Partitioning \(H\)-minor free graphs into three subgraphs with no large components
scientific article; zbMATH DE number 6813545

    Statements

    Partitioning \(H\)-minor free graphs into three subgraphs with no large components (English)
    0 references
    0 references
    0 references
    28 November 2017
    0 references
    vertex partitions
    0 references
    graph minors
    0 references
    odd minors
    0 references
    small components
    0 references

    Identifiers