Generating all 3-connected 4-regular planar graphs from the octahedron graph
نویسندگان
چکیده
We prove that all 3-connected 4-regular planar graphs can be generated from the Octahedron Graph, using three operations. We generated these graphs up to 15 vertices inclusive. Moreover, by including a fourth operation we obtain an alternative to a procedure by Lehel to generate all connected 4-regular planar graphs from the
منابع مشابه
Split Euler tours in 4-regular planar graphs
The construction of a homing tour is known to be NP-complete. On the other hand, the Euler formula puts sufficient restrictions on plane graphs that one should be able to assert the existence of such tours in some cases; in particular we focus on split Euler tours (SETs) in 3-connected, 4-regular, planar graphs (tfps). An Euler tour S in a graph G is a SET if there is a vertex v (called a half ...
متن کاملGenerating 5-regular planar graphs
For k = 0, 1, 2, 3, 4, 5, let Pk be the class of k-edge-connected 5regular planar graphs. In this paper, graph operations are introduced that generate all graphs in each Pk. ∗Research partially supported by NSF grants DMS-0556091 and ITR-0326387. †Research partially supported by Board of Regents grant LEQSF(2004-07)-RD-A-22.
متن کاملEnumeration of labeled 4-regular planar graphs
In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4regular planar graphs can be computed effectively as the solution of a system of equations. From here we can extract the coefficients by means of algebraic ...
متن کاملA characterization of some graph classes using excluded minors
In this article we present a structural characterization of graphs without K5 and the octahedron as a minor. We introduce semiplanar graphs as arbitrary sums of planar graphs, and give their characterization in terms of excluded minors. Some other excluded minor theorems for 3-connected minors are shown.
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 17 شماره
صفحات -
تاریخ انتشار 1993