"On the Complexity of Deciding Whether the Regular Number is at Most Two."

Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi (2015)

> Home

Details and statistics

DOI: 10.1007/S00373-014-1446-9

access: closed

type: Journal Article

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/DehghanSA15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/DehghanSA15
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi:
On the Complexity of Deciding Whether the Regular Number is at Most Two. Graphs Comb. 31(5): 1359-1365 (2015)

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.