"On the minimum edge size for 2-colorability and realizability of ..."

Nirman Kumar (2017)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2017-12-11

- no documents available
- export record
  dblp key:
  - conf/cccg/Kumar17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/Kumar17
Nirman Kumar:
On the minimum edge size for 2-colorability and realizability of hypergraphs by axis-parallel rectangles. CCCG 2017: 226-231

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.