A bijective proof of an identity for noncrossing graphs

Pavel Podbrdský
2003 Discrete Mathematics  
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.
doi:10.1016/s0012-365x(02)00677-5 fatcat:zaljzazim5gefaouotmsx2iiza