The number of connected labeled graphs with $n$ edges and $n$ nodes are listed in OEIS A057500.

I suspect the following must be known but I can't find a reference to it.

Question.How many among the above graphs are triangle-free?

**NOTE.** This problem is connected to my other MO question here.