Outerstring Graphs are $\chi$-Bounded (Q5244121)

From MaRDI portal
Revision as of 12:20, 20 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7133117
Language Label Description Also known as
English
Outerstring Graphs are $\chi$-Bounded
scientific article; zbMATH DE number 7133117

    Statements

    Outerstring Graphs are $\chi$-Bounded (English)
    0 references
    0 references
    0 references
    0 references
    20 November 2019
    0 references
    0 references
    geometric intersection graphs
    0 references
    string graphs
    0 references
    chromatic number
    0 references
    \( \chi \)-boundedness
    0 references