Graphs that admit right angle crossing drawings (Q419368)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graphs that admit right angle crossing drawings |
scientific article; zbMATH DE number 6036377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs that admit right angle crossing drawings |
scientific article; zbMATH DE number 6036377 |
Statements
Graphs that admit right angle crossing drawings (English)
0 references
18 May 2012
0 references
The authors consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. It is shown that if a graph with \(n\) vertices admits a RAC drawing with at most \(1\) bend or \(2\) bends per edge, then the number of edges is at most \(6.5n\) and \(74.2n\), respectively.
0 references
discharging
0 references
crossing lemma
0 references
polyline drawing
0 references
right angle crossing drawing
0 references
Archimedean tiling
0 references
graph
0 references
0.994686722755432
0 references
0.905493974685669
0 references
0.9053281545639038
0 references
0.9025619626045228
0 references
0.9001139998435974
0 references
