On the complexity of a hypermap

DOI10.1016/0012-365X(82)90219-9MaRDI QIDQ1173096zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• 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 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3298598 (Why is no real title available?)
• Spanning trees of dual graphs
• The Complexity of A Planar Hypermap And That of Its Dual

Cited in

(5)

• Spanning hypertrees, vertex tours and meanders
• Hypermaps and multiply quasiplatonic Riemann surfaces
• Operations on hypermaps, and outer automorphisms
• Totally chiral maps and hypermaps of small genus
• Hypermap operations of finite order

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

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