Toughness of Recursively Partitionable Graphs (Q6147455): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4389994590 / rank
 
Normal rank

Latest revision as of 10:47, 30 July 2024

scientific article; zbMATH DE number 7788531
Language Label Description Also known as
English
Toughness of Recursively Partitionable Graphs
scientific article; zbMATH DE number 7788531

    Statements

    Toughness of Recursively Partitionable Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 January 2024
    0 references
    0 references
    minimal 2-connected recursively partitionable graphs
    0 references
    0 references