"Smallest defining number of r-regular k-chromatic graphs: r ¹ k."

Ebadollah S. Mahmoodian, Behnaz Omoomi, Nasrin Soltankhah (2006)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2006-05-23

- no documents available
- export record
  dblp key:
  - journals/arscom/MahmoodianOS06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/MahmoodianOS06
Ebadollah S. Mahmoodian, Behnaz Omoomi, Nasrin Soltankhah:
Smallest defining number of r-regular k-chromatic graphs: r ¹ k. Ars Comb. 78 (2006)

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.