Graphs of separability at most 2 (Q415268)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Graphs of separability at most 2
scientific article

    Statements

    Graphs of separability at most 2 (English)
    0 references
    0 references
    0 references
    11 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    separability
    0 references
    hereditary class
    0 references
    separating clique
    0 references
    decomposition
    0 references
    induced subgraph
    0 references
    induced minor
    0 references
    parsimony haplotyping
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references