User blog comment:Wythagoras/Extension of SCG/@comment-1605058-20130813135100

Here is best sequence I found for CSCG(0,4)

G1 double loop

G2 loop on stick

G3 triangle

G4 double edge

G5 loop

G6 tree with two vertices of valence 3 (I believe there only one such with 6 vertices up to isomorphism)

G7 K1,4 with two vertices added to one vertex

G8-11 K1,4 with vertex added to respectively 3, 2, 1, 0 vertices

Now each Gn has one vertex of valence 3 and "arms" of sum of length smaller than n. Here are these by giving only lengths of arms:

9,1,1 - 8,3,1 - 8,2,2 - 8,2,1 - 8,1,1 - 7,7,2 - 7,7,1 - 7,6,5 - ... - 1,1,1

If my calculations are correct, last graph is G94. Now we have sequence of 95 paths and empty graph, giving CSCG(0,4)>=190.