2017
DOI: 10.1007/s10958-017-3550-x
|View full text |Cite
|
Sign up to set email alerts
|

On the Enumeration of Hypermaps Which are Self-Equivalent with Respect to Reversing the Colors of Vertices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…The partial picture in Figure 1 features a (5, 6)-hypermap. By analogy with fullerene polyhedra, we shall call (5,6)-hypermaps fullerene hypermaps, for short. However, in this case fullerene hypermaps do not have any specific restrictions (apart from those coming from the number of darts) on their topological genus, and thus on the number of pentagonal faces.…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…The partial picture in Figure 1 features a (5, 6)-hypermap. By analogy with fullerene polyhedra, we shall call (5,6)-hypermaps fullerene hypermaps, for short. However, in this case fullerene hypermaps do not have any specific restrictions (apart from those coming from the number of darts) on their topological genus, and thus on the number of pentagonal faces.…”
Section: Preliminariesmentioning
confidence: 99%
“…We shall refer to a (2, 3)-hypermap as a triangulation (of an oriented surface), thus allowing identification of two sides of the same triangle. Figure 2 shows a triangulation of a torus with α = (1, 4)(2, 5) (3,6), σ = (1, 6, 2, 4, 3, 5), ϕ = (1, 2, 3) (4,5,6).…”
Section: Preliminariesmentioning
confidence: 99%