Sign in

Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs.

Hajo BroersmaDaniël PaulusmaKiyoshi Yoshimoto
Published in: Graphs Comb. (2009)
Keyphrases
  • upper bound
  • small number
  • maximum number
  • machine learning
  • computational complexity
  • data sets
  • lower bound
  • sufficient conditions
  • graph matching
  • spanning tree
  • undirected graph