Spanning hypertrees, vertex tours and meanders

DOI10.1016/J.EJC.2023.103805MaRDI QIDQ6563989zbMATH OpenFDO

Authors Robert Cori, Gabor Hetyei

Publication date 28 June 2024

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

Full work available at URL https://doi.org/10.1016/J.EJC.2023.103805

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)

Recommendations

• Generating functions and counting formulas for spanning trees and forests in hypergraphs
• A version of Tutte's polynomial for hypergraphs
• Spanning trees on hypercubic lattices and nonorientable surfaces
• Trees and Euler Tours in a Planar Graph and its Relatives
• Hypertrees

Cites work

• scientific article; zbMATH DE number 3648728 (Why is no real title available?)
• scientific article; zbMATH DE number 3877182 (Why is no real title available?)
• scientific article; zbMATH DE number 3733946 (Why is no real title available?)
• scientific article; zbMATH DE number 3482371 (Why is no real title available?)
• scientific article; zbMATH DE number 3489159 (Why is no real title available?)
• scientific article; zbMATH DE number 3298598 (Why is no real title available?)
• scientific article; zbMATH DE number 2208541 (Why is no real title available?)
• A Map-Folding Problem
• A characterization of the Tutte polynomial via combinatorial embeddings
• A constructive enumeration of meanders
• A partial order for the set of meanders
• A version of Tutte's polynomial for hypergraphs
• Contribution a L'etude Du Probleme Des Timbres Poste
• Hypergraph polynomials and the Bernardi process
• Meander, folding, and arch statistics
• On the complexity of a hypermap
• On the structure of the lattice of noncrossing partitions
• Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
• 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
• Tree-like properties of cycle factorizations

Cited in

(3)

• A Whitney polynomial for hypermaps
• On reduced unicellular hypermonopoles
• Meanders and Dyck-path billiards

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)