A Planar Linear Hypergraph Whose Edges Cannot be Represented as Straight Line Segments - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Journal Articles European Journal of Combinatorics Year : 2009

A Planar Linear Hypergraph Whose Edges Cannot be Represented as Straight Line Segments

Daniel Gonçalves
Algorithmes, Graphes et Combinatoire
CV

Abstract

H. de Fraysseix and P. Ossona de Mendez asked whether every planar linear hypergraph H admits a planar representation in which the edges are straight line segments. In this article we exhibit a planar linear hypergraph that does not admit such a representation.

Domains

Combinatorics [math.CO]

Daniel Gonçalves  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00338324

Submitted on : Wednesday, November 12, 2008-4:56:17 PM

Last modification on : Monday, April 8, 2024-11:45:59 AM

Consult on ISTEX platform

Dates and versions

lirmm-00338324 , version 1 (12-11-2008)

Identifiers

Cite

Daniel Gonçalves. A Planar Linear Hypergraph Whose Edges Cannot be Represented as Straight Line Segments. European Journal of Combinatorics, 2009, 30 (1), pp.280-282. ⟨10.1016/j.ejc.2007.12.004⟩. ⟨lirmm-00338324⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM MIPS UNIV-MONTPELLIER
146 View
0 Download

Altmetric

Share

More