论文信息 - The Construction of Cubic and Quartic Planar Maps with Prescribed Face Degrees

The Construction of Cubic and Quartic Planar Maps with Prescribed Face Degrees

In this paper, the existence and availability of computer programs to constructively enumerate all simple connected cubic or quartic planar maps with prescribed number of vertices and face degrees is announced and results of the programs are presented. The underlying algorithms of the computer programs are described.

Gunnar Brinkmann | Thomas Harmuth | Oliver Heidemeier

[1] Andreas W. M. Dress,et al. Polyoxometalates: A class of compounds with remarkable topology , 1993 .

[2] D. Manolopoulos,et al. Theoretical studies of the fullerenes: C34 to C70 , 1991 .

[3] Patrick W. Fowler,et al. Energetics of Fullerenes with Four-Membered Rings , 1996 .

[4] D. Manolopoulos,et al. An Atlas of Fullerenes , 1995 .

[5] S. C. O'brien,et al. C60: Buckminsterfullerene , 1985, Nature.

[6] Gunnar Brinkmann,et al. Isomorphism rejection in structure generation programs , 1998, Discrete Mathematical Chemistry.

[7] N. Trinajstic,et al. Resonance energies of fullerenes with 4‐membered rings , 1995 .

[8] Andreas W. M. Dress,et al. A Constructive Enumeration of Fullerenes , 1997, J. Algorithms.

[9] L. Beineke,et al. Selected Topics in Graph Theory 2 , 1985 .

[10] Gunnar Brinkmann,et al. Problems and scope of spiral algorithms and spiral codes for polyhedral cages , 1997 .

[11] Michel Deza,et al. Lists of Face-Regular Polyhedra , 2000, J. Chem. Inf. Comput. Sci..

[12] Markus Meringer,et al. Fast generation of regular graphs and construction of cages , 1999, J. Graph Theory.

[13] H. Kroto,et al. C 60 Buckminsterfullerene , 1990 .