"Conflict-Free Colourings of Graphs and Hypergraphs."

János Pach, Gábor Tardos (2009)

> Home

Details and statistics

DOI: 10.1017/S0963548309990290

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/PachT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/PachT09
János Pach, Gábor Tardos:
Conflict-Free Colourings of Graphs and Hypergraphs. Comb. Probab. Comput. 18(5): 819-834 (2009)

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.