Triangle-free planar graphs as segments intersection graphs (Q4501713)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1500690
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Triangle-free planar graphs as segments intersection graphs |
scientific article; zbMATH DE number 1500690 |
Statements
4 September 2000
0 references
triangle-free planar graph
0 references
0.8546497821807861
0 references
0.8287842273712158
0 references
0.7743064761161804
0 references
Triangle-free planar graphs as segments intersection graphs (English)
0 references
The authors show that every triangle-free planar graph is the intersection graph of a set of segments in the plane where the segments can be chosen in only three directions (horizontal, vertical and oblique). An intersection graph has a vertex for every segment and two vertices are adjacent if the corresponding segments intersect. For the entire collection see [Zbl 0931.00046].
0 references
