Supported by the National Natural Science Foundation of China(No.10271017,11371133,11571044);the Natural Science Foundation Project of Chongqing(No.cstc2012jj A00041,cstc2014jcyj A00041);the Innovation Foundation of Chongqing(No.KJTD201321)
A map is 4-regular unicursal if all its vertices are 4-valent except two odd-valent vertices. This paper investigates the number of rooted 4-regular unicursal planar maps and presents some formulae for such maps with ...
supported by NSFC(No.11371133);the Natural Science Foundation Project of CQ(No.cstc2014jcyjA00041,No.cstc2014jcyjA00054);Chongqing Municipal Education Commission(No.KJ1401106)
The authors are indebted to the referees for their suggestions, which improved the presentation and made it more readable. This work was supported by the National Natural Science Foundation of China (Grant Nos. 11301169, 11371133), Hunan Provincial Natural Science Foundation of China (Nos. 13J J4110, 14JJ3138), and Hunan Education Department Talented Foundation (No. 16B028).
In this paper, two recursive inequalities for crossing numbers of graphs are given by using basic counting method. As their applications, the crossing numbers of K1,3,n and K4,n / e are determined, respectively.