Login / Signup
Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable.
Zhengke Miao
Yingqian Wang
Chuanni Zhang
Huajun Zhang
Published in:
Discret. Math. (2018)
Keyphrases
</>
planar graphs
least squares