Login / Signup

Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable.

Hervé HocquardMickaël Montassier
Published in: Inf. Process. Lett. (2009)
Keyphrases
  • planar graphs
  • minimum weight
  • pairwise
  • special case
  • higher order
  • approximate inference