default search action
"Equimatchable graphs are C2k+1-free for k≥4."
Cemil Dibek et al. (2016)
- Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable graphs are C2k+1-free for k≥4. Discret. Math. 339(12): 2964-2969 (2016)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.