def atlas6():
 Atlas = graph_atlas_g()[0:208]
 U = nx.Graph()
 for G in Atlas:
  zerodegree = [n for n in G if (G.degree(n) == 0)]
  for n in zerodegree:
   G.remove_node(n)
  U = nx.disjoint_union(U, G)
 C = nx.connected_component_subgraphs(U)
 UU = nx.Graph()
 nlist = []
 for G in C:
  if (not iso(G, nlist)):
   nlist.append(G)
   UU = nx.disjoint_union(UU, G)
 return UU

def atlas6 ( ) : Atlas = graph_atlas_g ( ) [ 0 : 208 ] U = nx . Graph ( ) for G in Atlas : zerodegree = [ n for n in G if ( G . degree ( n ) == 0 ) ] for n in zerodegree : G . remove_node ( n ) U = nx . disjoint_union ( U , G ) C = nx . connected_component_subgraphs ( U ) UU = nx . Graph ( ) nlist = [ ] for G in C : if ( not iso ( G , nlist ) ) : nlist . append ( G ) UU = nx . disjoint_union ( UU , G ) return UU
return the atlas of all connected graphs of 6 nodes or less .