A new upper bound on the chromatic number of graphs with no odd $K_t$ minor (Q6331224)
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: A new upper bound on the chromatic number of graphs with no odd $K_t$ minor |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new upper bound on the chromatic number of graphs with no odd $K_t$ minor |
scientific article |
Statements
16 December 2019
0 references
math.CO
0 references