We introduce the Density Formula for (topological) drawings of graphs in the plane or on the
sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the …

The study of nonplanar drawings of graphs with restricted crossing configurations is a well-
established topic in graph drawing, often referred to as beyond-planar graph drawing. One …

Graph drawing beyond planarity is a research area that has received an increasing attention
in the last twenty years, driven by the necessity to mitigate the visual complexity inherent in …

图着色问题(graph coloring problem, GCP) 是一个经典的组合优化问题, 已广泛应用于数学,
计算机科学和生物科学等多个领域. 由于图着色问题的NP 难特性, 目前还没有多项式时间内的 …

A nonplanar drawing Γ of a graph G divides the plane into topologically connected regions,
called faces (or cells). The boundary of each face is formed by vertices, crossings, and edge …

The study of nonplanar drawings of graphs with restricted crossing configurations is a well-
established topic in graph drawing, often referred to as beyond-planar graph drawing. One …

A nonplanar drawing Γ of a graph G divides the plane into topologically connected regions,
called faces (or cells). The boundary of each face is formed by vertices/crossings and edges …