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

Cemil Dibek et al. (2015)

> Home

Details and statistics

DOI: —

access: unavailable

type: Informal or Other Publication

metadata version: 2020-04-17

- no documents available
- export record
  dblp key:
  - conf/colognetwente/DibekEGS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colognetwente/DibekEGS15
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable Graphs are C_2k+1-free for k ≥ 4. CTW 2015: 125-128

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.