Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Cemil Dibek et al. (2016)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2016.06.003

access: open

type: Journal Article

metadata version: 2024-02-05

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/DibekEGS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/DibekEGS16
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable graphs are C_2k+1-free for k≥4. Discret. Math. 339(12): 2964-2969 (2016)

a service of

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.