"On the Complexity of Finding the Chromatic Number of a Recursive Graph II: ..."

Richard Beigel, William I. Gasarch (1989)

> Home

Details and statistics

DOI: 10.1016/0168-0072(89)90037-7

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/apal/BeigelG89a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apal/BeigelG89a
Richard Beigel, William I. Gasarch:
On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case. Ann. Pure Appl. Log. 45(3): 227-246 (1989)

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.