Crossing Number of Several Complete Bipartite Graphs by Deleting One Edge
Huang Yuan-qiu · Journal of Henan Normal University · 2011
Let km,ndenote the complete bipartite graph,and km,n\e denote the graph km,n obtained by deleting one edge.This paper finds out the upper bound of the crossing number by establishing a good drawing of km,n\e,then proves that this upper bound is the crossing number of k3,n\e and k4,n\e,and the crossing number of k3,n\e and k4,n\e is respectively z(3,n)-「n/2」+1 and z(4,n)-「n/2」+1.