A projection of the bouquet graph B with two cycles is said to be trivial if only trivial embeddings are obtained from the projection. In this paper a finite set of nontrivial embeddings of B is shown to be minimal among those which produce all nontrivial projections of B
A cycle C of a graph F embedded in a 3-manifold M is said to be trivial in F if it bounds a disk wit...
AbstractLet K be a subgraph of G. Suppose that we have a 2-cell embedding of K in some surface and t...
AbstractThe cycle double cover conjecture is equivalent to the ‘pseudosurface embedding conjecture’ ...
AbstractWe investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
A set S of cycles is minimal unavoidable in a graph family [formula] if each graph [formula] contain...
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a suf...
AbstractWe prove Sachs′ conjecture that a graph can be embedded in 3-space so that it contains no no...
AbstractIn this paper we study the cycle base structures of embedded graphs on surfaces. We first gi...
Robertson, Seymour, and Thomas characterized linkless embeddings of graphs by flat embeddings, and d...
The question of how to find the smallest genus of all embeddings of a given finite connected graph ...
AbstractIn 1930 Kuratowski proved that a graph does not embed in the real plane R2 if and only if it...
Abstract. Robertson, Seymour and Thomas characterized linkless embeddings of graphs by flat embeddin...
A planar graph is said to be trivializable if every regular projection produces a trivial embedding ...
AbstractThe notion of a basic embedding appeared in research motivated by Kolmogorov–Arnold's soluti...
A planar graph is a graph that can be drawn in such a way in the plane, so that no edges cross each ...
A cycle C of a graph F embedded in a 3-manifold M is said to be trivial in F if it bounds a disk wit...
AbstractLet K be a subgraph of G. Suppose that we have a 2-cell embedding of K in some surface and t...
AbstractThe cycle double cover conjecture is equivalent to the ‘pseudosurface embedding conjecture’ ...
AbstractWe investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
A set S of cycles is minimal unavoidable in a graph family [formula] if each graph [formula] contain...
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a suf...
AbstractWe prove Sachs′ conjecture that a graph can be embedded in 3-space so that it contains no no...
AbstractIn this paper we study the cycle base structures of embedded graphs on surfaces. We first gi...
Robertson, Seymour, and Thomas characterized linkless embeddings of graphs by flat embeddings, and d...
The question of how to find the smallest genus of all embeddings of a given finite connected graph ...
AbstractIn 1930 Kuratowski proved that a graph does not embed in the real plane R2 if and only if it...
Abstract. Robertson, Seymour and Thomas characterized linkless embeddings of graphs by flat embeddin...
A planar graph is said to be trivializable if every regular projection produces a trivial embedding ...
AbstractThe notion of a basic embedding appeared in research motivated by Kolmogorov–Arnold's soluti...
A planar graph is a graph that can be drawn in such a way in the plane, so that no edges cross each ...
A cycle C of a graph F embedded in a 3-manifold M is said to be trivial in F if it bounds a disk wit...
AbstractLet K be a subgraph of G. Suppose that we have a 2-cell embedding of K in some surface and t...
AbstractThe cycle double cover conjecture is equivalent to the ‘pseudosurface embedding conjecture’ ...
DOI
Add to ORKG