A Whitney polynomial for hypermaps

DOI10.1016/J.AAM.2025.102951MaRDI QIDQ6932298zbMATH OpenFDO

Authors Robert Cori, Gabor Hetyei

Publication date 9 September 2025

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AAM.2025.102951

zbMATH Keywords

characteristic polynomialchromatic polynomialcircuit partitionflow polynomialgenus of a hypermapmedial mapnoncrossing partitionsset partitionsTutte polynomialWhitney polynomial

Mathematics Subject Classification ID

Partitions of sets (05A18) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Graph polynomials (05C31) Hypergraphs (05C65)

Cites work

• A characterization of the Tutte polynomial via combinatorial embeddings
• A Contribution to the Theory of Chromatic Polynomials
• A polynomial of graphs on surfaces
• A version of Tutte's polynomial for hypergraphs
• Combinatorial statistics on alternating permutations
• Evaluations of the circuit partition polynomial
• Exploring the Tutte-Martin connection
• Flows on hypermaps
• scientific article; zbMATH DE number 3648728 (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 1933265 (Why is no real title available?)
• scientific article; zbMATH DE number 1369835 (Why is no real title available?)
• scientific article; zbMATH DE number 1439417 (Why is no real title available?)
• scientific article; zbMATH DE number 1445310 (Why is no real title available?)
• scientific article; zbMATH DE number 3298598 (Why is no real title available?)
• Hypermaps versus bipartite maps
• Identities for circuit partition polynomials, with applications to the Tutte polynomial
• Le Polynôme De Martin D'un Graphe Eulerien
• New results for the Martin polynomial
• Noncrossing partitions
• On the complexity of a hypermap
• On the computational complexity of the Jones and Tutte polynomials
• On the evaluation at (3,3) of the Tutte polynomial of a graph
• Remarkable valuation of the dichromatic polynomial of planar multigraphs
• Root polytopes and Jaeger‐type dissections for directed graphs
• Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
• Spanning hypertrees, vertex tours and meanders
• The Complexity of A Planar Hypermap And That of Its Dual
• The lattice of non-crossing partitions and the Birkhoff-Lewis equations
• Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings

Cited in

(1)

• Partial-duals for plane hypermaps

This page was built for publication: A Whitney polynomial for hypermaps

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