"Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs."

Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-27660-6_16

access: closed

type: Conference or Workshop Paper

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sofsem/CheilarisKP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sofsem/CheilarisKP12
Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi:
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. SOFSEM 2012: 190-201

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.