AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific structure. By exhibiting this structure we indirectly characterize graphs on the projective plane whose dual graphs are planar. Whitney's Theorem about 2-switching equivalence of planar embeddings is generalized: Any two embeddings of a planar graph in the projective plane can be obtained from each other by means of simple local reembeddings, very similar to Whitney's switchings
AbstractWe shall show that a connected graph G is projective-planar if and only if it has a projecti...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
AbstractWe investigate the question of which graphs have planar emulators (a locally-surjective homo...
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...
AbstractWhitney [7] proved in 1932 that for any two embeddings of a planar 3-connected graph, their ...
We give a detailed algebraic characterization of when a graph G can be imbedded in the projective pl...
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...
We give a detailed algebraic characterization of when a graph G can be imbedded in the projective pl...
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...
In this note we give a short and elementary proof of a more general version of Whitney's theorem tha...
AbstractIn a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bou...
AbstractWe shall show that a connected graph G is projective-planar if and only if it has a projecti...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
AbstractWe investigate the question of which graphs have planar emulators (a locally-surjective homo...
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...
AbstractWhitney [7] proved in 1932 that for any two embeddings of a planar 3-connected graph, their ...
We give a detailed algebraic characterization of when a graph G can be imbedded in the projective pl...
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...
We give a detailed algebraic characterization of when a graph G can be imbedded in the projective pl...
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...
In this note we give a short and elementary proof of a more general version of Whitney's theorem tha...
AbstractIn a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bou...
AbstractWe shall show that a connected graph G is projective-planar if and only if it has a projecti...
Given two embeddings σ1 and σ2 of a labeled nonplanar graph in the projective plane, we give a colle...
AbstractWe investigate the question of which graphs have planar emulators (a locally-surjective homo...
DOI
Add to ORKG