In this paper, we have calculated the combinatorial counting relations varying over the 3-vertex paths of a simple graph G, by restricting our attention to C3, C4-free graphs.