Silly question - Request for quick answer

Can anybody give information about is there any theorem/formula for the
following..
if number of vertex is n then how many 3 connected cubic planar
graphs are possible?

For example, if n=4 then number of graphs possible=1
if n=6 then number of graphs possible=1
I found a link given below:

http://people.csse.uwa.edu.au/gordon/remote/cubicplanar/viewgraph.html
But here no formula is provided for n vertex.

Wishing quick reply
Babu

.

Relevant Pages

  • Re: Silly question - Request for quick answer
    ... if number of vertex is n then how many 3 connected cubic planar ... graphs are possible? ... (together with lots of information on the sequences); ... if you look hrad enough at that site you'll find what you want. ...
    (sci.math)
  • Silly question-Please answer quickly
    ... Can anybody give information about is there any theorem/formula for the ... if number of vertex is n then how many 3 connected cubic planar ... graphs are possible? ... Wishing quick reply ...
    (comp.theory)
  • Silly question-Please answer quickly
    ... Can anybody give information about is there any theorem/formula for the ... if number of vertex is n then how many 3 connected cubic planar ... graphs are possible? ... Wishing quick reply ...
    (sci.logic)