Split-Perfect Graphs: Characterizations and Algorithmic Use (Q4652596)

From MaRDI portal
scientific article; zbMATH DE number 2139138
Language Label Description Also known as
English
Split-Perfect Graphs: Characterizations and Algorithmic Use
scientific article; zbMATH DE number 2139138

    Statements

    Split-Perfect Graphs: Characterizations and Algorithmic Use (English)
    0 references
    0 references
    0 references
    28 February 2005
    0 references
    perfect graphs
    0 references
    \(P_4\)-structure of perfect graphs
    0 references
    graphs with \(P_4\)-structure of split graphs
    0 references
    perfectly orderable graphs
    0 references
    brittle graphs
    0 references
    superbrittle graphs
    0 references
    \(P_4\)-sparse graphs
    0 references
    \(P_4\)-lite graphs
    0 references
    \(P_4\)-laden graphs
    0 references
    good characterization
    0 references
    linear time recognition
    0 references
    primeval decomposition tree
    0 references

    Identifiers