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

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

> Home

Details and statistics

DOI: 10.1137/120880471

access: closed

type: Journal Article

metadata version: 2020-04-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/CheilarisKP13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/CheilarisKP13
Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi:
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. SIAM J. Discret. Math. 27(4): 1775-1787 (2013)

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.