A New Upper Bound on the Chromatic Number of Graphs with No Odd Kt Minor
Crossref DOI link: https://doi.org/10.1007/s00493-021-4390-3
Published Online: 2021-08-31
Published Print: 2022-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Norin, Sergey
Song, Zi-Xia
Text and Data Mining valid from 2021-08-31
Version of Record valid from 2021-08-31
Article History
Received: 2 December 2019
Revised: 14 January 2021
First Online: 31 August 2021