|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'500'096
Articles rated: 2609
19 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
On the size of planarly connected crossing graphs | | Eyal Ackerman
; Balázs Keszegh
; Mate Vizer
; | | Date: |
8 Sep 2015 | | Abstract: | A pair of independent and crossing edges in a drawing of a graph is planarly
connected if there is a crossing-free edge that connects endpoints of the
crossed edges. A graph is a planarly connected crossing (PCC) graph, if it
admits a drawing in which every pair of independent and crossing edges is
planarly connected. We prove that a PCC graph with $n$ vertices has $O(n)$
edges. | | Source: | arXiv, 1509.2475 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER