"Complexity of Hypergraph Coloring and Seidel's Switching."

Jan Kratochvíl (2003)

> Home

Details and statistics

DOI: 10.1007/978-3-540-39890-5_26

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/Kratochvil03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/Kratochvil03
Jan Kratochvíl:
Complexity of Hypergraph Coloring and Seidel's Switching. WG 2003: 297-308

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.