"On the algorithmic complexity of coloring simple hypergraphs and Steiner ..."

Kevin T. Phelps, Vojtech Rödl (1984)

> Home

Details and statistics

DOI: 10.1007/BF02579160

access: closed

type: Journal Article

metadata version: 2020-07-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/PhelpsR84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/PhelpsR84
Kevin T. Phelps, Vojtech Rödl:
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems. Comb. 4(1): 79-88 (1984)

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.