Equimatchable graphs are C2k+ 1-free for k≥ 4
Başlık | Equimatchable graphs are C2k+ 1-free for k≥ 4 |
Publication Type | Journal Article |
Year of Publication | 2016 |
Authors | Dibek, C., T. Ekim, D. Gözüpek, and M. Shalom |
Journal | Discrete Mathematics |
Volume | 339 |
Pagination | 2964–2969 |