Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (Q6500104)

From MaRDI portal
Revision as of 08:58, 31 December 2024 by Import241231081222 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 7845510
Language Label Description Also known as
English
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
scientific article; zbMATH DE number 7845510

    Statements

    Sparse graphs with bounded induced cycle packing number have logarithmic treewidth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 May 2024
    0 references
    treewidth
    0 references
    induced cycles
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers