๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The 2 and 3 representative projective planar embeddings

โœ Scribed by Richard Vitray

Book ID
103501780
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
617 KB
Volume
54
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Bounding the number of embeddings of 5-c
Bounding the number of embeddings of 5-connected projective-planar graphs
โœ Shigeru Kitakubo ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 268 KB

A graph is said to be projective-planar if it is nonplanar and is embeddable in a projective plane. In this paper we show that the numbers of projectiveplanar embeddings (up to equivalence) of all 5-connected graphs have an upper bound c( 1120).

Minimal embeddings in the projective pla
Minimal embeddings in the projective plane
โœ Randby, Scott P. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 161 KB

We show that if G is a graph embedded on the projective plane in such a way that each noncontractible cycle intersects G at least n times and the embedding is minimal with respect to this property (i.e., the representativity of the embedding is n), then G can be reduced by a series of reduction oper