Abstract

Several arguments are presented which provide restrictions on the possible number of crossings in drawings of bipartite graphs. In particular it is shown that cr(K 5,n) =4[1/2 n][1/2( n−1)] and cr(K 6,n) =6[1/2 n][1/2( n−1)].

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call