Login / Signup

A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5.

Tao PanLei Sun
Published in: Discret. Math. Algorithms Appl. (2018)
Keyphrases
  • planar graphs
  • higher order
  • dynamic programming
  • maximum likelihood
  • graph cuts