logo

Alternating plane graphs

An alternating plane graph is a simple, connected plane graph, with minimum degree equal to 3 and where each face has at least 3 sides, in which no pair of adjacent vertices have the same degree, and no pair of adjacent faces have the same number of sides.

For weak alternating plane graphs, we loosen the definition to also allow graphs with minimum degree equal to 2.

The graph lists are currently only available in 'planar_code' format. The larger files are compressed with gzip.

Alternating plane graphs

These graphs were constructed by the exhaustive algorithm described in [1] and the program is available at [2]. The numbers were independently verified.

VerticesGraphs
10
20
30
40
50
60
70
80
90
100
110
120
130
140
150
160
172
180
195
Go to top

Weak alternating plane graphs

Below we list the number of weak alternating plane graphs with degrees 2 and k for 3 ≤ k ≥ 8. These graphs were constructed using the technique described in [1] and the programs are available at [2].

n\k345678
9-1----
10------
11------
12-1----
13------
14------
15-2----
16---1--
17------
18-4----
19------
201--0--
21-7----
22------
23------
24-19-1--
256-----
26------
27-43----
28--71--
29------
3043125---1
31------
32---11--
33-368----
34------
35316-139--0
36-1 264-101-
37------
38------
39-4 744----
402 420--83-1
41------
42-18 7234 731---
43------
44------
4519 64878 657---1
46------
47------
48-338 945----
49------
50165 724-----
51-1 518 480----
52------
53------
54------
551 437 049-----
Go to top

References

[1] I. Althöfer, J.K. Haugland, K. Scherer, F. Schneider, N. Van Cleemput, Ars Mathematica Contemporanea, 8(2), 337-363, 2015.

[2] https://github.com/nvcleemp/alternating


Copyright © 2010-2025 Ghent University & KU Leuven

Our website uses functional cookies to enhance your user experience. By using this site, you agree to our use of cookies. Learn more

Close