Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded (Q6038594): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
(No difference)

Revision as of 15:13, 25 April 2024

scientific article; zbMATH DE number 7681184
Language Label Description Also known as
English
Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded
scientific article; zbMATH DE number 7681184

    Statements

    Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded (English)
    0 references
    0 references
    0 references
    0 references
    2 May 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    twin-width
    0 references
    chi-boundedness
    0 references
    quasi-polynomial
    0 references
    chromatic number
    0 references