Graphs that admit right angle crossing drawings (Q419368): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q59702325, #quickstatements; #temporary_batch_1712111774907 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59702325 / rank | |||
Normal rank | |||
Revision as of 03:38, 3 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs that admit right angle crossing drawings |
scientific article |
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
