On the complexity of a hypermap

DOI10.1016/0012-365X(82)90219-9zbMath0503.05024OpenAlexW1972387457MaRDI QIDQ1173096

Antonio Machì

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90219-9

zbMATH Keywords

permutationgenushypertreehypermap

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

Operations on hypermaps, and outer automorphisms ⋮ Hypermaps and multiply quasiplatonic Riemann surfaces ⋮ Hypermap operations of finite order ⋮ Totally chiral maps and hypermaps of small genus

Cites Work

• Spanning trees of dual graphs
• The Complexity of A Planar Hypermap And That of Its Dual
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of a hypermap