The Complexity of A Planar Hypermap And That of Its Dual

DOI10.1016/S0167-5060(08)70034-7zbMath0466.05051OpenAlexW76594971MaRDI QIDQ3918150

Robert Cori, Jean-Guy Penaud

Publication date: 1980

Published in: Combinatorics 79 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70034-7

zbMATH Keywords

characteristic of a hypermapunderlying hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (5)

Universal Tutte polynomial ⋮ On the complexity of a hypermap ⋮ Binary functions, degeneracy, and alternating dimaps ⋮ Hypermap-homology quantum codes ⋮ Coloring face hypergraphs on surfaces

This page was built for publication: The Complexity of A Planar Hypermap And That of Its Dual