Login / Signup

Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof.

Nathann CohenFrédéric Havet
Published in: Discret. Math. (2010)
Keyphrases
  • planar graphs
  • edge information
  • image segmentation
  • edge detection
  • weighted graph
  • special case
  • minimum weight