The crossing number of K5,n+1∖e

作者：

Highlights：

•

摘要

Let K5,n+1∖e (n ≥ 0) denote the complete bipartite graph K5,n+1 with one edge deleted. In this paper, we show that the crossing number of K5,n+1∖e is n(n−1).

论文关键词：Graph,Drawing,Crossing number,Complete bipartite graph

论文评审过程：Received 1 September 2019, Revised 10 January 2020, Accepted 19 January 2020, Available online 3 March 2020, Version of Record 3 March 2020.

论文官网地址：https://doi.org/10.1016/j.amc.2020.125075