A planar linear hypergraph whose edges cannot be represented as straight line segments

European Journal of Combinatorics

Volumn 30, Issue 1, 2009, Pages 280-282

  Goncalves D ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 53949110282     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2007.12.004     Document Type: Article

References (3)

1. de Fraysseix H., and Ossona de Mendez P. Representations by contact and intersection of segments. Algorithmica 47 (2007) 453-463
2. J. Chalopin, D. Gonçalves, Every planar graph is the intersection graph of segments in the plane, manuscript
3. Open Problem Garden, retrieved Oct. 2007 at: http://garden.irmacs.sfu.ca