Login / Signup

Acyclic edge colouring of planar graphs without short cycles.

Mieczyslaw BorowieckiAnna Fiedorowicz
Published in: Discret. Math. (2010)
Keyphrases
  • planar graphs
  • weighted graph
  • undirected graph
  • edge information
  • edge detection
  • np hard
  • minimum weight
  • np complete
  • lower bound
  • approximation algorithms
  • probabilistic inference