Chromatic number of ordered graphs with forbidden ordered subgraphs (Q1715066): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00493-017-3593-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00493-017-3593-0 / rank | |||
Normal rank | |||
Latest revision as of 05:42, 11 December 2024
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
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
ordered graphs
0 references
chromatic number
0 references
forbidden subgraph
0 references
