login
A124159
Maximal order of a complete graph that is the union of two graphs which can both be embedded on a sphere with n handles.
1
8, 13, 14, 15
OFFSET
1,1
COMMENTS
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.
REFERENCES
L. W. Beineke, Biplanar graphs: a survey, Computers Math. Applic., 34 (1997), 1-8.
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 02 2006
STATUS
approved