Planar Graphs Without Adjacent Cycles of Length at Most Five are (2, 0, 0)-Colorable
Crossref DOI link: https://doi.org/10.1007/s40840-020-01004-8
Published Online: 2020-08-28
Published Print: 2021-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Li, Xiangwen http://orcid.org/0000-0001-9328-0766
Shen, Qin
Tian, Fanyu
Funding for this research was provided by:
National Natural Science Foundation of China (11571134)
Text and Data Mining valid from 2020-08-28
Version of Record valid from 2020-08-28
Article History
Received: 16 February 2020
Revised: 14 August 2020
Accepted: 17 August 2020
First Online: 28 August 2020