Enumeration of chord diagrams without loops and parallel chords

zbMath1369.05112arXiv1601.05073MaRDI QIDQ2401429

Evgeniy Krasko, Alexander Omelchenko

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.05073

zbMATH Keywords

shapesgenerating functionsHamiltonian pathschord diagramsunlabelled enumeration\(n\)-dimensional octahedron

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Generating Functions for Domino Matchings in the $2\times k$ Game of Memory ⋮ Unfolding cubes: nets, packings, partitions, chords ⋮ Enumeration of labeled and unlabeled Hamiltonian cycles in complete \(k\)-partite graphs ⋮ Linear $k$-Chord Diagrams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian circuits on the \(n\)-dimensional octahedron
• ENUMERATING THE k-TANGLE PROJECTIONS
• A Course in Enumeration
• A Bijection for Rooted Maps on Orientable Surfaces

This page was built for publication: Enumeration of chord diagrams without loops and parallel chords