Chromatic number of ordered graphs with forbidden ordered subgraphs (Q1715066)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Chromatic number of ordered graphs with forbidden ordered subgraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8150439262390137
0 references
0.8042166233062744
0 references
0.7951047420501709
0 references
0.7948988676071167
0 references
0.7852444648742676
0 references
