Counting non-isomorphic chord diagrams

DOI10.1016/S0304-3975(98)00031-0zbMath0913.68148MaRDI QIDQ1275460

Michel Marcus, Robert Cori

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

mapschordsenumerationisomorphic structures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Counting unlabelled chord diagrams of maximal genus, Formation of a giant component in the intersection graph of a random chord diagram, On a uniformly random chord diagram and its intersection graph, Counting maps on doughnuts, Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings, Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices, Description of degenerate two-dimensional singularities with single critical point

Cites Work

• Unnamed Item
• Unnamed Item
• Colorings of hypermaps and a conjecture of Brenner and Lyndon
• The Riemann-Hurwitz formula for the centralizer of a pair of permutations
• Counting rooted maps by genus. III: Nonseparable maps
• Maps, hypermaps and their automorphisms: A survey. III
• On the Vassiliev knot invariants
• The Euler characteristic of the moduli space of curves
• Harvey-Wiman hypermaps
• Enumeration of (uni- or bicolored) plane trees according to their degree distribution
• Counting rooted maps by genus. I
• Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
• The number of plane trees
• A Census of Planar Maps