Discover the SciOpen Platform and Achieve Your Research Goals with Ease.
Search articles, authors, keywords, DOl and etc.
In [J. Combin. Theory Ser. B, 99 (2009), 447-454)], Li characterized the classification of vertex-transitive embeddings of complete graphs, and proposed how to enumerate such maps. In this paper, we study the counting problem of orientable vertex-transitive embeddings of
This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)
Comments on this article