Login / Signup

Edge-choosability of planar graphs without adjacent triangles or without 7-cycles.

Jianfeng HouGuizhen LiuJiansheng Cai
Published in: Discret. Math. (2009)
Keyphrases
  • np hard
  • planar graphs
  • undirected graph
  • weighted graph
  • minimum cost
  • edge information
  • edge detection
  • partition function
  • closed form
  • minimum weight
  • bayesian networks
  • bipartite graph
  • random fields