|
%I #10 Sep 29 2015 18:11:19
%S 0,1,3,16,134,1210,11719,114478,1108826,10606795,100352404,940956644,
%T 8762227629,81168427279,748953936818
%N Number of n-node triangulations of the projective plane N_1 in which every node has degree >= 3.
%H G. Ringel, <a href="http://gdz.sub.uni-goettingen.de/dms/resolveppn/?PPN=GDZPPN002284766">Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann</a>, Math. Ann. 130 (1955), 317-326.
%H Thom Sulanke, <a href="http://hep.physics.indiana.edu/~tsulanke/graphs/surftri/">Generating triangulations of surfaces (surftri)</a>, (also subpages).
%H Thom Sulanke, <a href="http://arxiv.org/abs/1509.06412">Generating maps on surfaces</a>, arXiv:1509.06412 [math.CO], (21-September-2015)
%K nonn,more
%O 5,3
%A _N. J. A. Sloane_, May 12 2007
|
