Chromatic number of ordered graphs with forbidden ordered subgraphs (Q1715066)

From MaRDI portal
Revision as of 22:17, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Chromatic number of ordered graphs with forbidden ordered subgraphs
scientific article

    Statements

    Chromatic number of ordered graphs with forbidden ordered subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    1 February 2019
    0 references
    An ordered graph is a graph together with a linear ordering of its vertex set. The paper considers the behavior of the chromatic number of ordered graphs with forbidden ordered subgraphs. The authors prove and describe several infinite classes of minimal ordered forests. Known results for forests with at most three edges are summarized.
    0 references
    0 references
    ordered graphs
    0 references
    chromatic number
    0 references
    forbidden subgraph
    0 references
    0 references
    0 references