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

Daniel Gonçalves

doi:10.1016/j.ejc.2007.12.004

Article Dans Une Revue European Journal of Combinatorics Année : 2009

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

(1)

Daniel Gonçalves

Fonction : Auteur
PersonId : 7100
IdHAL : daniel-goncalves
ORCID : 0000-0003-3228-9622
IdRef : 117629413

Algorithmes, Graphes et Combinatoire

Résumé

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.

Domaines

Combinatoire [math.CO]

Daniel Gonçalves : Connectez-vous pour contacter le contributeur

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

Soumis le : mercredi 12 novembre 2008-16:56:17

Dernière modification le : lundi 8 avril 2024-11:45:59

Dates et versions

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

Identifiants

HAL Id : lirmm-00338324 , version 1
DOI : 10.1016/j.ejc.2007.12.004

Citer

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM MIPS UNIV-MONTPELLIER

140 Consultations

0 Téléchargements

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

Résumé

Domaines

Dates et versions

Identifiants

Citer

Exporter

Collections

Altmetric

Partager