Spanning hypertrees, vertex tours and meanders
From MaRDI portal
Publication:6563989
Recommendations
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
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)