"Coloring nonuniform hypergraphs: A new algorithmic approach to the general ..."

Artur Czumaj, Christian Scheideler (2000)

> Home

Details and statistics

DOI: 10.1002/1098-2418(200010/12)17:3/4<213::AID-RSA3>3.0.CO;2-Y

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/CzumajS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/CzumajS00
Artur Czumaj, Christian Scheideler:
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms 17(3-4): 213-237 (2000)

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.