A292515 -id:A292515 - cp's OEIS frontend

A111361 The number of 4-regular plane graphs with n vertices with all faces 3-gons or 4-gons.

0, 0, 0, 0, 1, 0, 1, 1, 2, 1, 5, 2, 8, 5, 12, 8, 25, 13, 30, 23, 51, 33, 76, 51, 109, 78, 144, 106, 218, 150, 274, 212, 382, 279, 499, 366, 650, 493, 815, 623, 1083, 800, 1305, 1020, 1653, 1261, 2045, 1554, 2505, 1946, 3008, 2322, 3713, 2829, 4354, 3418, 5233, 4063, 6234

Offset: 2

Gunnar Brinkmann, Nov 07 2005

nonn

These are the 4-regular graphs corresponding to the 3-regular fullerenes. Only the two smallest possible face sizes are allowed. The numbers up to a(33) have been checked by 2 independent programs. Further numbers have not been checked independently.

			From _Allan Bickle_, May 13 2024: (Start)
The smallest example (n=6) is the octahedron (only 3-gons).
For n=8, the unique graph is the square of an 8-cycle.
For n=9, the unique graph is the dual of the Herschel graph. (End)

Andrey Zabolotskiy, Table of n, a(n) for n = 2..131 (from Hasheminezhad & McKay)
G. Brinkmann, O. Heidemeier and T. Harmuth, The construction of cubic and quartic planar maps with prescribed face degrees, Discrete Applied Mathematics 128: 541-554, (2003).
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]
Michel-Marie Deza, Mathieu Dutour Sikiric and Mikhail Ivanovitch Shtogrin, Geometric Structure of Chemistry-Relevant Graphs, Springer, 2015; see Sec. 4.4.
Mathieu Dutour Sikiric and Michel Deza, 4-regular and self-dual analogs of fullerenes, arXiv:0910.5323 [math.GT], 2009.
Mahdieh Hasheminezhad and Brendan D. McKay, Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4, Discussiones Mathematicae Graph Theory, 30 (2010), 123-136.
T. Tarnai, F. Kovács, P. W. Fowler and S. D. Guest, Wrapping the cube and other polyhedra, Proc. Roy. Soc. A 468(2145) (2012), 2652-2666. DOI: 10.1098/rspa.2012.0116.

Cf. A007894.
Cf. A167156, A167157, A167158, A167159.
Cf. A007022, A072552, A078666, A292515 (4-regular planar graphs with restrictions).

Leading zeros prepended, terms a(34) and beyond added from the book by Deza et al. (except for a(60) from the paper by Brinkmann et al.) by Andrey Zabolotskiy, Oct 09 2021

A078666 Number of isomorphism classes of simple quadrangulations of the sphere having n+2 vertices and n faces, minimal degree 3, with orientation-reversing isomorphisms permitted.

Original entry on oeis.org

1, 0, 1, 1, 3, 3, 12, 19, 64, 155, 510, 1514, 5146, 16966, 58782, 203269, 716607, 2536201, 9062402, 32533568, 117498072, 426212952, 1553048548, 5681011890, 20858998805, 76850220654, 284057538480, 1053134292253, 3915683667721

Offset: 6

Slavik V. Jablan and Brendan McKay Feb 06 2003

nonn

Number of basic polyhedra with n vertices.
Initial terms of sequence coincide with A007022. Starting from n=12, to it is added the number of simple 4-regular 4-edge-connected but not 3-connected plane graphs on n nodes (A078672). As a result we obtain the number of basic polyhedra.
a(n) counts 4-valent 4-edge-connected planar maps (or plane graphs on a sphere) up to reflection with no regions bounded by just 2 edges. Conway called such maps "basic polyhedra" and used them in his knot notation. 2-edge-connected maps (which start occurring from n=12) are not taken into account here because they generate only composite knots and links. - Andrey Zabolotskiy, Sep 18 2017

			G.f. = x^6 + x^8 + x^9 + 3*x^10 + 3*x^11 + 12*x^12 + 19*x^13 + 64*x^14 + ...
From _Allan Bickle_, May 13 2024: (Start)
For n=6, the unique graph is the octahedron.
For n=8, the unique graph is the square of an 8-cycle.
For n=9, the unique graph is the dual of the Herschel graph. (End)

J. H. Conway, An enumeration of knots and links and some of their related properties. Computational Problems in Abstract Algebra, Proc. Conf. Oxford 1967 (Ed. J. Leech), 329-358. New York: Pergamon Press, 1970.

G. Brinkmann, S. Greenberg, C. Greenhill, B. D. McKay, R. Thomas, and P. Wollan, Generation of simple quadrangulations of the sphere, Discr. Math., 305 (2005), 33-54.
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]
A. Caudron, Classification des noeuds et des enlacements, Public. Math. d'Orsay 82. Orsay: Univ. Paris Sud, Dept. Math., 1982.
Alain Caudron, Classification des noeuds et des enlacements (Thèse et additifs), Univ. Paris-Sud, 1989 [Scanned copy, included with permission]. Contains additional material.
CombOS - Combinatorial Object Server, generate planar graphs
S. V. Jablan, Ordering Knots
S. V. Jablan, L. M. Radović, and R. Sazdanović, Basic polyhedra in knot theory Kragujevac J. Math., 28 (2005), 155-164.
The Knot Atlas, Conway Notation.
Index entries for sequences related to knots

Cf. A007022, A078672, A113201, A072552, A111361.

Cf. A292515 (abstract planar graphs with same restrictions).

Name and offset corrected by Andrey Zabolotskiy, Aug 22 2017

A007022 Number of 4-regular polyhedra with n nodes.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 1, 1, 3, 3, 11, 18, 58, 139, 451, 1326, 4461, 14554, 49957, 171159, 598102, 2098675, 7437910, 26490072, 94944685, 341867921, 1236864842, 4493270976, 16387852863, 59985464681, 220320405895, 811796327750, 3000183106119

Offset: 1

N. J. A. Sloane, Apr 28 1994

Number of simple 4-regular 4-edge-connected 3-connected planar graphs; by Steinitz's theorem, every such graph corresponds to a single planar map up to orientation-reversing isomorphism. Equivalently, number of 3-connected quadrangulations of sphere with orientation-reversing isomorphisms permitted with n faces. - Andrey Zabolotskiy, Aug 22 2017

			For n=6, the sole 6-vertex 4-regular polyhedron is the octahedron. The corresponding 6-face quadrangulation is its dual graph, i. e., the cube graph.
From _Allan Bickle_, May 13 2024: (Start)
For n=8, the unique graph is the square of an 8-cycle.
For n=9, the unique graph is the dual of the Herschel graph. (End)

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Gunnar Brinkmann, Sam Greenberg, Catherine Greenhill, Brendan D. McKay, Robin Thomas, and Paul Wollan, Generation of simple quadrangulations of the sphere, Discr. Math., 305 (2005), 33-54. doi:10.1016/j.disc.2005.10.005
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]
CombOS - Combinatorial Object Server, generate planar graphs
Michael B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties, Journal of Combinatorial Theory Series B 66:1 (1996), 87-122.
Slavik V. Jablan, Ljiljana M. Radović, and Radmila Sazdanović, Basic polyhedra in knot theory, Kragujevac J. Math. (2005) Vol. 28, 155-164.
Jorik Jooken, Computer-assisted graph theory: a survey, arXiv:2508.20825 [math.CO], 2025. See Ref. 197 at p. 5.
T. Tarnai, F. Kovács, P. W. Fowler, and S. D. Guest, Wrapping the cube and other polyhedra, Proc. Roy. Soc. A 468(2145) (2012), 2652-2666. DOI: 10.1098/rspa.2012.0116.

Cf. A000944 (all polyhedral graphs), A113204, A078672, A078666 (total number of simple 4-regular 4-edge-connected planar maps, including not 3-connected ones).

Cf. A072552, A078666, A111361, A292515 (4-regular planar graphs with restrictions).

More terms from Hugo Pfoertner, Mar 22 2003
a(29) corrected by Brendan McKay, Jun 22 2006
Leading zeros prepended by Max Alekseyev, Sep 12 2016
Offset corrected by Andrey Zabolotskiy, Aug 22 2017

A072552 Number of connected planar regular graphs of degree 4 with n nodes.

Original entry on oeis.org

1, 0, 1, 1, 3, 3, 13, 21, 68, 166, 543, 1605, 5413, 17735, 61084, 210221, 736287

Offset: 6

Markus Meringer (meringer(AT)uni-bayreuth.de), Aug 05 2002

Numbers were obtained using the graph generator GENREG in combination with a test for planarity implemented by M. Raitner.

			From _Allan Bickle_, May 13 2024: (Start)
For n=6, the unique graph is the octahedron.
For n=8, the unique graph is the square of an 8-cycle.
For n=9, the unique graph is the dual of the Herschel graph. (End)

Markus Meringer, GENREG
Markus Meringer, GenReg, Generation of regular graphs.
Markus Meringer, Tables of Regular Graphs
M. Raitner, Test for planarity [broken link]
Robert E. Tuzun and Adam S. Sikora, Verification Of The Jones Unknot Conjecture Up To 22 Crossings, Journal of Knot Theory and Its Ramifications (2018) 1840009, arXiv:1606.06671 [math.GT], 2016-2020 (see table 2).

Cf. A005964, A006820, A078666, A292515 (4-edge-connected graphs only).

Cf. A007022, A111361 (other 4-regular planar graphs).

a(19)-a(22) from Andrey Zabolotskiy, Mar 21 2018 from Tuzun & Sikora.

cp's OEIS Frontend

A111361 The number of 4-regular plane graphs with n vertices with all faces 3-gons or 4-gons.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A078666 Number of isomorphism classes of simple quadrangulations of the sphere having n+2 vertices and n faces, minimal degree 3, with orientation-reversing isomorphisms permitted.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Extensions

A007022 Number of 4-regular polyhedra with n nodes.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Extensions

A072552 Number of connected planar regular graphs of degree 4 with n nodes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions