Login / Signup

Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded.

Cemil DibekTínaz EkimPinar Heggernes
Published in: Discret. Math. (2017)
Keyphrases
  • maximum number
  • graph matching
  • pattern matching
  • undirected graph
  • object recognition
  • np hard
  • scale space
  • matching algorithm
  • edge detector
  • weighted graph
  • edge information
  • graph theoretic