A few words about maps
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10515252" target="_blank" >RIV/00216208:11320/24:10515252 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=fmO.uGDyvR" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=fmO.uGDyvR</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2023.103810" target="_blank" >10.1016/j.ejc.2023.103810</a>
Alternative languages
Result language
angličtina
Original language name
A few words about maps
Original language description
In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a topological representation of maps with a given spanning quasi-tree using two fundamental polygons, which extends the representation of planar maps based on the equivalence with bipartite circle graphs. Then, we focus on Depth-First Search trees and their connection with a poset we define on the spanning quasi-trees of a map. We apply the bijections obtained in the first section to the problem of enumerating loopless rooted maps. Finally, we return to the planar case and discuss a decomposition of planar rooted loopless maps and its consequences on planar rooted loopless map enumeration.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
European Journal of Combinatorics
ISSN
0195-6698
e-ISSN
1095-9971
Volume of the periodical
119
Issue of the periodical within the volume
June 2024
Country of publishing house
GB - UNITED KINGDOM
Number of pages
23
Pages from-to
103810
UT code for WoS article
001247369900001
EID of the result in the Scopus database
2-s2.0-85173433537