Advanced Search

Question: Someone can help me to compute crossing number of some small graphs?

Question: Someone can help me to compute crossing number of some small graphs?

lcz 994 Maple 2019
graphtheory
December 19 2019
0

In graph theory, the crossing number cr(G) of a graph G is the lowest number of edge crossings of a plane drawing of the graph G. I'd like to use maple to compute crossing number of some graphs (any graphs is ok,  for example： cr(K5)=1 ). Someone can help me ? thanks. 

I know the problem of computing the crossing number is NP, but I guess we have some good  ways to compute in some small graphs.
Please Wait...