|
%I #4 Mar 30 2012 16:50:35
%S 8,13,14,15
%N Maximal order of a complete graph that is the union of two graphs which can both be embedded on a sphere with n handles.
%C a(3) is known to be 15 or 16. I have put 15 here because otherwise the sequence would be too short to include in the OEIS. But the true value is (or was in 1997 at least) not known.
%D L. W. Beineke, Biplanar graphs: a survey, Computers Math. Applic., 34 (1997), 1-8.
%Y Cf. A124156-A124158.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Dec 02 2006
|
