A new upper bound on the chromatic number of graphs with no odd $K_t$ minor
From MaRDI portal
Publication:6331224
DOI10.1007/S00493-021-4390-3zbMath1513.05160arXiv1912.07647WikidataQ114229219 ScholiaQ114229219MaRDI QIDQ6331224
Publication date: 16 December 2019
This page was built for publication: A new upper bound on the chromatic number of graphs with no odd $K_t$ minor