Login / Signup

Minimum size of feedback vertex sets of planar graphs of girth at least five.

Tom KellyChun-Hung Liu
Published in: Eur. J. Comb. (2017)
Keyphrases
  • planar graphs
  • minimum weight
  • undirected graph
  • minimum cost
  • spanning tree
  • objective function
  • directed graph