On triangle contact graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Combinatorics, Probability and Computing Année : 1994

On triangle contact graphs

Résumé

It is proved that any plane graph may be represented by a triangle contact system, that is a collection of triangular disks which are disjoint except at contact points, each contact point being a node of exactly one triangle. Representations using contacts of T- of Y-shaped objects follow. Moreover, there is a one-to-one mapping between all the triangular contact representations of a maximal plane graph and all its partitions into three Schnyder trees.
Fichier non déposé

Dates et versions

hal-00005621 , version 1 (26-06-2005)

Identifiants

  • HAL Id : hal-00005621 , version 1

Citer

Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl. On triangle contact graphs. Combinatorics, Probability and Computing, 1994, 3, pp.233-246. ⟨hal-00005621⟩

Collections

CNRS EHESS
104 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More