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

TitleEquimatchable graphs are C2k+ 1-free for k≥ 4
Publication TypeJournal Article
Year of Publication2016
AuthorsDibek, C., T. Ekim, D. Gözüpek, and M. Shalom
JournalDiscrete Mathematics
Volume339
Pagination2964–2969