On Triangle Contact Graphs
Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl
Source record
Source: Crossref
Published: Jun 1, 1994
DOI: 10.1017/s0963548300001139
Open original source ↗Source abstract
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-or 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.