The archive file contains files describing every bi-equivalent planar graph.Each folder of the type LM contains the graph of valencies L and M.Each sub-folder in these folder correspond to 1 graph.Their content is:- f.par : the PGC for the graph- a txt file: file describing the connectivity of the graph (see below for the format).- a svg file: vector graphic file for the graph. Syntax of the txt file:Line 1 : the number of nodes for the graphLine 2 : the nodes for the outside face (usually "0 1 2 P-1")Following lines except last 2 lines: "n1 n2" : the indices of 2 nodes linked together.Line -2 from the end: "N0 n1 n2 ... nn" : the list of nodes of the 1st type.Last line: "N1 n1 n2 ... nn", the list of nodes of the 2nd type.