Login / Signup

Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests.

Eun-Kyung ChoIlkyoo ChoiBoram Park
Published in: Discret. Math. (2021)
Keyphrases
  • planar graphs
  • pairwise
  • dynamic programming
  • integrity constraints
  • directed graph
  • message passing