I download one  file about  all 5 connected graphs with graph6  (total 21 graphs). format from http://users.cecs.anu.edu.au/~bdm/data/graphs.html，and I want to import it in Maple. Since platform restrictions , I can not attach the file .   Please download it by yourself，very thanks to you ! 

   I put the file  in the installation path of  Maple in my computer：D:\\ Program Files\Maple 2019. （my computer system is Window 10 )  And I import it like following: 

  But it  only imports the graph of  the first row in the file. How to import all graphs in a file of graph6 format one time?

   It would seem that the option style = planar  of DrawGraph()    is  failure when some graphs are planar.
   For example: 

treeof5:=[NonIsomorphicGraphs(5,4,output= graphs,outputform=graph,restrictto = connected )]:
DrawGraph ~ (treeof5, stylesheet=[vertexborder=false,vertexpadding=20]);

 

We know tree is planar graph obviously. But when I add the option style = planar ,  drawing of the first tree of list displays an error :
Error, (in GraphTheory:-Graph) vertex 1 cannot be its own neighbour in list of neighbours

I did not find any reason to explain. 

         I'd like to draw a graph with its  vertices  of 3d style.  Just like following image：

  I did not find the desired choices for this graph.

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.

 I'd like to get all at most 15 vertices Non-isomorphic  connected  bipartite graphs. One way is to use the function NonIsomorphicGraphs(k, output = graphs, outputform = graph, restrictto = connected).

with(GraphTheory):

k:=8;
s1:=[NonIsomorphicGraphs(k,restrictto = connected,output=graphs,outputform=graph)]:
bipartitegraph:=select[flatten](x->IsBipartite(x)=true, s1):
nops(bipartitegraph);
But when k=9, it is slow, I doubted that the code 

By Checking out the encyclopedia，http://oeis.org/A033995 , we knew the following number of bipartite graphs datas of , at most 14, they are not many（the datas contain  no-connected conditions)

so I read the help document about  

awesome.

Ps： I know  in SageMath  we can get all bipartite graphs quikly even though n>=10  by  using the 

for g in graphs.nauty_geng('-c -b 10 -g'):
 But I hope it can be realized in Maple. 

Thanks!