Login / Signup
Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable.
Xiangwen Li
Mao Zhang
Published in:
Australas. J Comb. (2023)
Keyphrases
</>
planar graphs
dynamic programming
np hard
markov random field