Add to ORKGGiven two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a collection of maneuvers on projective-planar embeddings that can be used to take σ1 to σ
A basic problem in graph embedding theory is to determine distinct embeddings of planar graphs on hi...
We give various conditions on pinched-torus polyhedral maps which are necessary for their graphs to ...
AbstractIt will be shown that the number of equivalence classes of embeddings of a 3-connected nonpl...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
AbstractIn this paper, we characterize those projective-plane 3-connected graphs which admit re-embe...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
AbstractIt is shown that embeddings of planar graphs in arbitrary surfaces other than the 2-sphere h...
We give a detailed algebraic characterization of when a graph G can be imbedded in the projective pl...
AbstractTwo embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorph...
AbstractA graph embedded on a surface is n-representative if every nontrivial closed curve in the su...
AbstractIt will be shown that the number of equivalence classes of embeddings of a 3-connected nonpl...
AbstractLet G be a 5-connected graph not isomorphic to the complete graph K6 with 6 vertices and tri...
We give various conditions on pinched-torus polyhedral maps which are necessary for their graphs to ...
A basic problem in graph embedding theory is to determine distinct embeddings of planar graphs on hi...
We give various conditions on pinched-torus polyhedral maps which are necessary for their graphs to ...
AbstractIt will be shown that the number of equivalence classes of embeddings of a 3-connected nonpl...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
AbstractIn this paper, we characterize those projective-plane 3-connected graphs which admit re-embe...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
AbstractIt is shown that embeddings of planar graphs in arbitrary surfaces other than the 2-sphere h...
We give a detailed algebraic characterization of when a graph G can be imbedded in the projective pl...
AbstractTwo embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorph...
AbstractA graph embedded on a surface is n-representative if every nontrivial closed curve in the su...
AbstractIt will be shown that the number of equivalence classes of embeddings of a 3-connected nonpl...
AbstractLet G be a 5-connected graph not isomorphic to the complete graph K6 with 6 vertices and tri...
We give various conditions on pinched-torus polyhedral maps which are necessary for their graphs to ...
A basic problem in graph embedding theory is to determine distinct embeddings of planar graphs on hi...
We give various conditions on pinched-torus polyhedral maps which are necessary for their graphs to ...
AbstractIt will be shown that the number of equivalence classes of embeddings of a 3-connected nonpl...