A bijective proof of an identity for noncrossing graphs

DOI10.1016/S0012-365X(02)00677-5zbMath1008.05042OpenAlexW2116875154WikidataQ114122940 ScholiaQ114122940MaRDI QIDQ1861266

Pavel Podbrdský

Publication date: 16 March 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00677-5

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Extremal problems for ordered hypergraphs: small patterns and some enumeration ⋮ Identities for non-crossing graphs and multigraphs

This page was built for publication: A bijective proof of an identity for noncrossing graphs