"On the complexity of bicoloring clique hypergraphs of graphs."

Jan Kratochvíl, Zsolt Tuza (2002)

> Home

Details and statistics

DOI: 10.1016/S0196-6774(02)00221-3

access: closed

type: Journal Article

metadata version: 2017-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/KratochvilT02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/KratochvilT02
Jan Kratochvíl, Zsolt Tuza:
On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45(1): 40-54 (2002)

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.