Spanning hypertrees, vertex tours and meanders

DOI10.1016/J.EJC.2023.103805zbMATH Open1542.05041MaRDI QIDQ6563989FDOQ6563989

Gabor Hetyei, Robert Cori

Publication date: 28 June 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

spanning treesgenushypertree

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Exact enumeration problems, generating functions (05A15) Graph polynomials (05C31) Partitions of sets (05A18) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• A characterization of the Tutte polynomial via combinatorial embeddings
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• On the structure of the lattice of noncrossing partitions
• Tree-like properties of cycle factorizations
• Contribution a L'etude Du Probleme Des Timbres Poste
• Title not available (Why is that?)
• On the complexity of a hypermap
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Complexity of A Planar Hypermap And That of Its Dual
• A Map-Folding Problem
• A version of Tutte's polynomial for hypergraphs
• Meander, folding, and arch statistics
• Title not available (Why is that?)
• Title not available (Why is that?)
• A partial order for the set of meanders
• Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
• A constructive enumeration of meanders
• Title not available (Why is that?)
• Hypergraph polynomials and the Bernardi process

This page was built for publication: Spanning hypertrees, vertex tours and meanders

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