Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
Crossref DOI link: https://doi.org/10.1007/s10878-016-0039-3
Published Online: 2016-06-13
Published Print: 2017-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bai, Ying
Li, Xiangwen
Yu, Gexin
Funding for this research was provided by:
National Natural Science Foundation of China (11571134)
License valid from 2016-06-13