Spanning hypertrees, vertex tours and meanders

DOI10.1016/j.ejc.2023.103805zbMath1542.05041MaRDI QIDQ6563989

Gábor Hetyei, Robert Cori

Publication date: 28 June 2024

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

zbMATH Keywords

genushypertreespanning trees

Mathematics Subject Classification ID

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

Cites Work

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

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