Identities for non-crossing graphs and multigraphs

DOI10.1016/J.DISC.2007.12.035zbMATH Open1200.05058OpenAlexW1975420239MaRDI QIDQ998488FDOQ998488

Authors: 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

Recommendations

• A bijective proof of an identity for noncrossing graphs
• Noncrossing trees and noncrossing graphs
• On trees and noncrossing partitions
• k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams
• Enumeration of noncrossing trees on a circle

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

Cited In (3)

• A bijective proof of an identity for noncrossing graphs
• Title not available (Why is that?)
• \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998488)