A bijective proof of an identity for noncrossing graphs

We give a bijective proof for the identity an+2=8bn, where an is the number of noncrossing simple graphs with n (possibly isolated) vertices and bn is the number of noncrossing graphs without isolated vertices and with n (possibly multiple) edges.