AbstractAn algorithm is presented for determining whether a cubic graph (i.e., every vertex of which has valence 3) can be imbedded in the torus. An imbedding is produced in the affirmative. The algorithm has running time bounded by a polynomial in the number of vertices of the graph
International audienceWe consider the embeddability problem of a graph G into a two-dimensional simp...
Graph embeddings play a significant role in the design and analysis ofparallel algorithms. It is a m...
The cubic lattice is a graph in R3 whose vertices are all points with coordinates (x, y, z) where x,...
AbstractAn algorithm is presented for determining whether a cubic graph (i.e., every vertex of which...
Embedding graphs on the torus is a problem with both theoretical and practical significance. It is r...
In this article we present theoretical and computational results on theexistence of polyhedral embed...
In this article we present theoretical and computational results on the existence of polyhedral embe...
AbstractIt is frequently of interest to represent a given graph G as a subgraph of a graph H which h...
This paper provides the complete proof of the fact that any planar cubic graph is at most single-ben...
A graph is cubical if it is a subgraph of a hypercube; the dimension of the smallest such hypercube ...
It turns out that there exist numerous useful classes of cubic graphs. Some are needed in connection...
It turns out that there exist numerous useful classes of cubic graphs. Some are needed in connection...
AbstractThere exist very efficient algorithms to decide whether a graph is planar. How difficult can...
International audienceWe consider the embeddability problem of a graph G into a two-dimensional simp...
International audienceWe consider the embeddability problem of a graph G into a two-dimensional simp...
International audienceWe consider the embeddability problem of a graph G into a two-dimensional simp...
Graph embeddings play a significant role in the design and analysis ofparallel algorithms. It is a m...
The cubic lattice is a graph in R3 whose vertices are all points with coordinates (x, y, z) where x,...
AbstractAn algorithm is presented for determining whether a cubic graph (i.e., every vertex of which...
Embedding graphs on the torus is a problem with both theoretical and practical significance. It is r...
In this article we present theoretical and computational results on theexistence of polyhedral embed...
In this article we present theoretical and computational results on the existence of polyhedral embe...
AbstractIt is frequently of interest to represent a given graph G as a subgraph of a graph H which h...
This paper provides the complete proof of the fact that any planar cubic graph is at most single-ben...
A graph is cubical if it is a subgraph of a hypercube; the dimension of the smallest such hypercube ...
It turns out that there exist numerous useful classes of cubic graphs. Some are needed in connection...
It turns out that there exist numerous useful classes of cubic graphs. Some are needed in connection...
AbstractThere exist very efficient algorithms to decide whether a graph is planar. How difficult can...
International audienceWe consider the embeddability problem of a graph G into a two-dimensional simp...
International audienceWe consider the embeddability problem of a graph G into a two-dimensional simp...
International audienceWe consider the embeddability problem of a graph G into a two-dimensional simp...
Graph embeddings play a significant role in the design and analysis ofparallel algorithms. It is a m...
The cubic lattice is a graph in R3 whose vertices are all points with coordinates (x, y, z) where x,...
DOI
Add to ORKG