Computing well-covered vector spaces of graphs using modular decomposition (Q6184796)

From MaRDI portal
Revision as of 10:39, 22 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7784411
Language Label Description Also known as
English
Computing well-covered vector spaces of graphs using modular decomposition
scientific article; zbMATH DE number 7784411

    Statements

    Computing well-covered vector spaces of graphs using modular decomposition (English)
    0 references
    0 references
    0 references
    5 January 2024
    0 references
    weighted well-covered graph
    0 references
    well-covered vector space
    0 references
    modular decomposition
    0 references
    Gaussian elimination
    0 references
    fork-free graph
    0 references
    cograph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references