On RAC drawings of 1-planar graphs

Bekos, MA; Didimo, W; Liotta, G; Mehrabi, S; Montecchiani, F

Montecchiani, F (reprint author), Univ Perugia, Dipartimento Ingn, Perugia, Italy.

THEORETICAL COMPUTER SCIENCE, 2017; 689 ( ): 48

Abstract

A drawing of a graph is 1-planar if each edge is crossed at most once. A graph is 1-planar if it has a 1-planar drawing. A k-bend RAC (Right Angie Cro......

Full Text Link


Links

期刊讨论 | 中国SCI论文 | 期刊主页 | 投稿经验 | 杂志官网 | 投稿链接 | 作者需知 | PMC链接 | Pubmed全文检索