Let K be an induced non-separating subgraph of a graph G, andletB be the bridge of K in G. Obstructions for extending a given 2-cell embedding of K to an embedding of G in the same surface are considered. It is shown that it is possible to find a nice obstruction which means that it has bounded branch size up to a bounded number of “almost disjoint ” millipedes. Moreover, B contains a nice subgraph ˜ B with the following properties. If K is 2-cell embedded in some surface and F is a face of K, then ˜ B admits exactly the same types of embeddings in F as B. A linear time algorithm to construct such a universal obstruction ˜ B is presented. At the same time, for every type of embeddings of ˜ B, an embedding of B ofthesametypeis determined
"A graph $G$ is said to be uniquely embeddable in a surface $F^{2}$ if for any two embeddings $f_{1}...
We consider graphs that can be embedded on a surface of bounded genus such that each edge has a boun...
A 2-regular digraph is one where every vertex has in-degree and out-degree 2. This thesis focuses on...
AbstractLet K be a subgraph of G. Suppose that we have a 2-cell embedding of K in some surface and t...
Let K be a subgraph of G. Suppose that we have a 2-cell embedding of K in some surface and that for ...
AbstractLet K be a subgraph of G. Suppose that we have a 2-cell embedding of K in some surface and t...
AbstractLet G be a graph, and let H be a subgraph of G drawn in a surface Σ. When can this drawing b...
AbstractLet G be a graph, and let H be a subgraph of G drawn in a surface Σ. When can this drawing b...
Abstract: "A few steps are made towards representation theory of embeddability among uncountable gra...
AbstractWe investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
Only for two surfaces, the 2-sphere and the projective plane, the complete list of obstructions is k...
A class of graphs that lies strictly between the classes of graphs of genus (at most) k − 1 and k is...
International audienceWe consider the problem of deciding whether an input graph G admits a topologi...
AbstractThe cycle double cover conjecture is equivalent to the ‘pseudosurface embedding conjecture’ ...
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
"A graph $G$ is said to be uniquely embeddable in a surface $F^{2}$ if for any two embeddings $f_{1}...
We consider graphs that can be embedded on a surface of bounded genus such that each edge has a boun...
A 2-regular digraph is one where every vertex has in-degree and out-degree 2. This thesis focuses on...
AbstractLet K be a subgraph of G. Suppose that we have a 2-cell embedding of K in some surface and t...
Let K be a subgraph of G. Suppose that we have a 2-cell embedding of K in some surface and that for ...
AbstractLet K be a subgraph of G. Suppose that we have a 2-cell embedding of K in some surface and t...
AbstractLet G be a graph, and let H be a subgraph of G drawn in a surface Σ. When can this drawing b...
AbstractLet G be a graph, and let H be a subgraph of G drawn in a surface Σ. When can this drawing b...
Abstract: "A few steps are made towards representation theory of embeddability among uncountable gra...
AbstractWe investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
Only for two surfaces, the 2-sphere and the projective plane, the complete list of obstructions is k...
A class of graphs that lies strictly between the classes of graphs of genus (at most) k − 1 and k is...
International audienceWe consider the problem of deciding whether an input graph G admits a topologi...
AbstractThe cycle double cover conjecture is equivalent to the ‘pseudosurface embedding conjecture’ ...
AbstractA 2-cell embedding of a graph G into a closed (orientable or nonorientable) surface is calle...
"A graph $G$ is said to be uniquely embeddable in a surface $F^{2}$ if for any two embeddings $f_{1}...
We consider graphs that can be embedded on a surface of bounded genus such that each edge has a boun...
A 2-regular digraph is one where every vertex has in-degree and out-degree 2. This thesis focuses on...