On Triangle Contact Graphs
De Fraysseix, Hubert ; Ossona De Mendez, Patrice ; Rosenstiehl, Pierre
HAL, hal-00008999 / Harvested from HAL
Text on HAL
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.
Publié le : 1997-07-05
Classification:  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 
@article{hal-00008999,
     author = {De Fraysseix, Hubert and Ossona De Mendez, Patrice and Rosenstiehl, Pierre},
     title = {On Triangle Contact Graphs},
     journal = {HAL},
     volume = {1997},
     number = {0},
     year = {1997},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00008999}
}

De Fraysseix, Hubert; Ossona De Mendez, Patrice; Rosenstiehl, Pierre. On Triangle Contact Graphs. HAL, Tome 1997 (1997) no. 0, . http://gdmltest.u-ga.fr/item/hal-00008999/