Timeline for Is it possible that every edge in a 1-planar drawing with minimum number of crossings is crossed?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 29, 2022 at 23:26 | review | Low quality posts | |||
| Apr 30, 2022 at 7:42 | |||||
| Apr 19, 2022 at 15:01 | comment | added | Tony Huynh | Good point. Your picture cannot happen though, since we may draw the edge $uu'$ outside of the cycle to remove the crossing $y$. It could be that that $w$ and $u$' are not on $C$ though. I'll try to think of an argument for that case too. | |
| Apr 19, 2022 at 13:12 | history | answered | Xin Zhang | CC BY-SA 4.0 |