For hypermaps with hyperedges of length at most 3 the Whitney polynomial and spanning hypertrees depend only on the underlying hypergraph and admit deletion-contraction formulas; explicit counts are given for spanning hypertrees in reciprocals of maximum-degree-3 plane graphs.
Kreweras, Sur les partitions non crois´ ees d’un cycle,Discrete Math.1(1972), 333–350
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hypermaps with hyperedges of length at most $3$
For hypermaps with hyperedges of length at most 3 the Whitney polynomial and spanning hypertrees depend only on the underlying hypergraph and admit deletion-contraction formulas; explicit counts are given for spanning hypertrees in reciprocals of maximum-degree-3 plane graphs.