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 Octahedron Graph
Lovász conjectured that every connected 4-regular planar graph $G$ admits a <em>realization as a sys...
AbstractGiven four distinct vertices in a 4-connected planar graphG, we characterize when the graphG...
In this paper, we consider the problem of determining in polynomial time whether a given planar poin...
AbstractA 3-valent graph G is cyclically n-connected provided one must cut at least n edges in order...
A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that eve...
© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommo...
AbstractA simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such ...
Lovász conjectured that every connected 4-regular planar graph G admits a realization as a system of...
For k = 0, 1, 2, 3, 4, 5, let Pk be the class of k-edge-connected 5-regular planar graphs. In this p...
Back in the eighties, Heath [Algorithms for embedding graphs in books. PhD thesis, University of Nor...
We describe how the simple planar quadrangulations with vertices of degree 3 and 4, whose duals are ...
In this paper, the problem of randomly generating 4-regular planar Hamiltonian graphs is discussed a...
In this article we describe a recursive structure for the class of 4-connected triangulations or - e...
The construction of a homing tour is known to be NP-complete. On the other hand, the Euler formula p...
Lovász conjectured that every connected 4-regular planar graph G admits a realization as a system o...
Lovász conjectured that every connected 4-regular planar graph $G$ admits a <em>realization as a sys...
AbstractGiven four distinct vertices in a 4-connected planar graphG, we characterize when the graphG...
In this paper, we consider the problem of determining in polynomial time whether a given planar poin...
AbstractA 3-valent graph G is cyclically n-connected provided one must cut at least n edges in order...
A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that eve...
© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommo...
AbstractA simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such ...
Lovász conjectured that every connected 4-regular planar graph G admits a realization as a system of...
For k = 0, 1, 2, 3, 4, 5, let Pk be the class of k-edge-connected 5-regular planar graphs. In this p...
Back in the eighties, Heath [Algorithms for embedding graphs in books. PhD thesis, University of Nor...
We describe how the simple planar quadrangulations with vertices of degree 3 and 4, whose duals are ...
In this paper, the problem of randomly generating 4-regular planar Hamiltonian graphs is discussed a...
In this article we describe a recursive structure for the class of 4-connected triangulations or - e...
The construction of a homing tour is known to be NP-complete. On the other hand, the Euler formula p...
Lovász conjectured that every connected 4-regular planar graph G admits a realization as a system o...
Lovász conjectured that every connected 4-regular planar graph $G$ admits a <em>realization as a sys...
AbstractGiven four distinct vertices in a 4-connected planar graphG, we characterize when the graphG...
In this paper, we consider the problem of determining in polynomial time whether a given planar poin...
DOI
Add to ORKG