6-path-connectivity and 6-generation

We consider simple connected graphs for which there is a path of length at least 6 between every pair of distinct vertices. We wish to show that in these graphs the cycle space over Z2 is generated by the cycles of length at least 6. Furthermore, we wish to generalize the result for k-path-connected graphs which contain a long cycle.