Add to ORKGOnly for two surfaces, the 2-sphere and the projective plane, the complete list of obstructions is known. We aim to expand our understanding of obstructions for higher-genus surfaces by studying obstructions of low connectivity. Classes of graphs are described such that each obstruction of connectivity 2 is obtained as a 2-sum of graphs from those classes. In particular, this structure allows us to determine the complete lists of obstructions of connectivity 2 for the torus and the Klein bottle
Communicated by M. Nivat The Graph Minor Theorem of Robertson and Seymour establishes nonconstructiv...
AbstractIt is shown that the genus of an embedding of a graph can be determined by the rank of a cer...
This dissertation establishes two theorems which characterize the set of minimal obstructions for tw...
The complete set of minimal obstructions for embedding graphs into the torus is still not determined...
AbstractThe spindle surface S is the pinched surface formed by identifying two points on the sphere....
The spindle surface S is the pinched surface formed by identifying two points on the sphere. In thi...
A class of graphs that lies strictly between the classes of graphs of genus (at most) k − 1 and k is...
AbstractLet K be a subgraph of G. Suppose that we have a 2-cell embedding of K in some surface and t...
A 2-regular digraph is one where every vertex has in-degree and out-degree 2. This thesis focuses on...
AbstractThe spindle surface S is the pinched surface formed by identifying two points on the sphere....
The Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many natural gra...
AbstractThe Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many nat...
AbstractThe cycle double cover conjecture is equivalent to the ‘pseudosurface embedding conjecture’ ...
Let K be an induced non-separating subgraph of a graph G, andletB be the bridge of K in G. Obstructi...
Communicated by M. Nivat The Graph Minor Theorem of Robertson and Seymour establishes nonconstructiv...
Communicated by M. Nivat The Graph Minor Theorem of Robertson and Seymour establishes nonconstructiv...
AbstractIt is shown that the genus of an embedding of a graph can be determined by the rank of a cer...
This dissertation establishes two theorems which characterize the set of minimal obstructions for tw...
The complete set of minimal obstructions for embedding graphs into the torus is still not determined...
AbstractThe spindle surface S is the pinched surface formed by identifying two points on the sphere....
The spindle surface S is the pinched surface formed by identifying two points on the sphere. In thi...
A class of graphs that lies strictly between the classes of graphs of genus (at most) k − 1 and k is...
AbstractLet K be a subgraph of G. Suppose that we have a 2-cell embedding of K in some surface and t...
A 2-regular digraph is one where every vertex has in-degree and out-degree 2. This thesis focuses on...
AbstractThe spindle surface S is the pinched surface formed by identifying two points on the sphere....
The Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many natural gra...
AbstractThe Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many nat...
AbstractThe cycle double cover conjecture is equivalent to the ‘pseudosurface embedding conjecture’ ...
Let K be an induced non-separating subgraph of a graph G, andletB be the bridge of K in G. Obstructi...
Communicated by M. Nivat The Graph Minor Theorem of Robertson and Seymour establishes nonconstructiv...
Communicated by M. Nivat The Graph Minor Theorem of Robertson and Seymour establishes nonconstructiv...
AbstractIt is shown that the genus of an embedding of a graph can be determined by the rank of a cer...
This dissertation establishes two theorems which characterize the set of minimal obstructions for tw...