Identities for non-crossing graphs and multigraphs

DOI10.1016/j.disc.2007.12.035zbMath1200.05058OpenAlexW1975420239MaRDI QIDQ998488

Rubén Albiol, Marc Noy

Publication date: 28 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.035

zbMATH Keywords

enumerative combinatoricsnon-crossing graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Analytic combinatorics of non-crossing configurations
• Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
• A bijective proof of an identity for noncrossing graphs

This page was built for publication: Identities for non-crossing graphs and multigraphs