Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference3 articles.
1. Planar maps are well labeled trees;Cori;Canad. J. Math.,1981
2. R. Cori, Un code pour les grap;hes plannaires et sets apllications , Astérisque 27, SMF
3. Hypermaps versus bipartite maps;Walsh;J. Combin. Theory Ser. B,1975
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth;Journal of Combinatorial Theory, Series A;2020-10
2. Planar Maps;Handbook of Enumerative Combinatorics;2015-03-11
3. Map Generation for CO 2 Cages;Computer and Information Sciences III;2012-10-30
4. Unified bijections for maps with prescribed degrees and girth;Journal of Combinatorial Theory, Series A;2012-08
5. Random Maps and Their Scaling Limits;Fractal Geometry and Stochastics IV;2009