Upper bounds to the clique width of graphs (Q1975365)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Upper bounds to the clique width of graphs
scientific article

    Statements

    Upper bounds to the clique width of graphs (English)
    0 references
    0 references
    0 references
    30 March 2001
    0 references
    The authors bound the clique width of a graph in terms of its tree width and also in terms of the clique width of its edge complement.
    0 references
    hierarchical graph decomposition
    0 references
    modular decomposition
    0 references
    tree decomposition
    0 references
    algorithms
    0 references
    monadic second-order logic
    0 references

    Identifiers