✦ LIBER ✦

Planar graphs on the projective plane

✍ Scribed by Bojan Mohar; Neil Robertson; Richard P. Vitray

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 958 KB
Volume: 149
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00349-n

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Projective-planar graphs with even duals

✍ Seiya Negami 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 472 KB

## Abstract Let __G__ be a connected graph which is projective‐planar but is not planar. It will be shown that __G__ can be embedded in the projective plane so that it has only even faces if and only if either __G__ is bipartite or its canonical bipartite covering is planar and that such an embeddi

On light edges and triangles in projecti

On light edges and triangles in projective planar graphs

✍ Sanders, Daniel P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 376 KB 👁 2 views

An edge or face of an embedded graph is light if the sum of the degrees of the vertices incident with it is small. This paper parallelizes four inequalities on the number of light edges and light triangles from the plane to the projective plane. Each of the four inequalities is shown to be the best

An algebraic characterization of project

An algebraic characterization of projective-planar graphs

✍ Lowell Abrams; Daniel C. Slilaty 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

## Abstract We give a detailed algebraic characterization of when a graph __G__ can be imbedded in the projective plane. The characterization is in terms of the existence of a dual graph __G__\* on the same edge set as __G__, which satisfies algebraic conditions inspired by homology groups and inte

Enumeration of projective-planar embeddi

Enumeration of projective-planar embeddings of graphs

✍ Seiya Negami 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 562 KB

It will be shown that the number of equivalence classes of embeddings of a 3-connected nonplanar graph into a projective plane coincides with the number of isomorphism classes of planar double coverings of the graph and a combinatorial method to determine the number will be developed.

4-Connected Projective-Planar Graphs Are

4-Connected Projective-Planar Graphs Are Hamiltonian

✍ R. Thomas; X.X. Yu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 923 KB

Unique and faithful embeddings of projec

Unique and faithful embeddings of projective-planar graphs

✍ Seiya Negami 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB

A graph G is uniquelyembeddable in a surface f 2 if for any two embeddings f,,f2 : G + f 2 , there exists an isomorphism u : G + G and a homeo- admits an embedding f : G + F2 such that for any isomorphism (T : G + G, there is a homeomorphism h : F 2 f 2 with h . f = f . u. It will be shown that if