Enumerating all maximal clique-partitions of a graph
computes and displays all maximal clique-partitions of a graph made of the maximal cliques indicated in the list maximalCliques.
In[303]:=
Out[303]=
Test Examples
Some simple examples
In[346]:=
Out[346]=
In[347]:=
Out[347]=
In[348]:=
Out[348]=
Graphs G[n]
In[320]:=
In[349]:=
Out[349]=
In[350]:=
Out[350]=
In[351]:=
Out[351]=
Graphs H[n]
In[352]:=
In[353]:=
Out[353]=
Graphs G[m,n]
These graphs have m+n-1 vertices 
and n maximal cliques of order m: 
for 1<=i<=n.
In[327]:=
In[328]:=
Out[328]=
In[354]:=
Out[354]=
In[355]:=
Out[355]=
In[357]:=
Out[357]=
Graphs SK[n]
In[358]:=
In[359]:=
Out[359]=
In[360]:=
Out[360]=
In[361]:=
