Article,

Equimatchable graphs are C2k+1-free for k≥4.

, , , and .
Discret. Math., 339 (12): 2964-2969 (2016)

Meta data

Tags

Users

  • @dblp

Comments and Reviews