• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Planar graphs with cycles of length neither 4 nor 7 are (3, 0, 0)-colorable.

Huihui LiJinghan XuYingqian Wang
Published in: Discret. Math. (2014)
Keyphrases
  • planar graphs
  • minimum weight
  • markov random field