The chromatic number of ordered graphs with constrained conflict graphs (Q4595640)
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: The chromatic number of ordered graphs with constrained conflict graphs |
scientific article; zbMATH DE number 6815647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The chromatic number of ordered graphs with constrained conflict graphs |
scientific article; zbMATH DE number 6815647 |
Statements
6 December 2017
0 references
unordered graphs
0 references
integer graphs
0 references
math.CO
0 references
cs.DM
0 references
0.7948988676071167
0 references
0.7712439298629761
0 references
0.7609740495681763
0 references
0.7489781379699707
0 references
0.7417497634887695
0 references
