4-valent plane graphs with 2-, 3- and 4-gonal faces

Details 4-valent plane graphs with 2-, 3- and 4-gonal faces 4-valent plane graphs with 2-, 3- and 4-gonal faces

2002-12-27

arxiv.org/abs/math/0212351v2

Mathematics

Geometric Topology

27 pages, 16 figures, submitted to satellite conference (of ISM congress, (2002) Beijing) on Algebra and Combinatorics

Scientific paper

Call {\em i-hedrite} any 4-valent n-vertex plane graph, whose faces are 2-, 3- and 4-gons only and $p_2+p_3=i$. The edges of an i-hedrite, as of any Eulerian plane graph, are partitioned by its {\em central circuits}, i.e. those, which are obtained by starting with an edge and continuing at each vertex by the edge opposite the entering one. So, any i-hedrite is a projection of an alternating link, whose components correspond to its central circuits. Call an i-hedrite {\em irreducible}, if it has no {\em rail-road}, i.e. a circuit of 4-gonal faces, in which every 4-gon is adjacent to two of its neighbors on opposite edges. We present the list of all i-hedrites with at most 15 vertices. Examples of other results: (i) All i-hedrites, which are not 3-connected, are identified. (ii) Any irreducible i-hedrite has at most i-2 central circuits. (iii) All i-hedrites without self-intersecting central circuits are listed. (iv) All symmetry group of i-hedrites are listed.

Affiliated with

Also associated with

No associations

Rating

4-valent plane graphs with 2-, 3- and 4-gonal faces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with 4-valent plane graphs with 2-, 3- and 4-gonal faces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 4-valent plane graphs with 2-, 3- and 4-gonal faces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-550786