Title of article
A bijective proof of an identity for noncrossing graphs
Author/Authors
Pavel Podbrdsk?، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
5
From page
249
To page
253
Abstract
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.
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
949452
Link To Document