𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algebraic characterization of projective-planar graphs

✍ Scribed by Lowell Abrams; Daniel C. Slilaty

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
114 KB
Volume
42
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

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 intersection products in homology groups. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 42: 320–331, 2003

πŸ“œ 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

Re-embedding structures of 4-connected p
Re-embedding structures of 4-connected projective-planar graphs
✍ Yusuke Suzuki πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 212 KB

We identify the structures of 4-connected projective-planar graphs which generate their inequivalent embeddings on the projective plane, showing two series of graphs the number of whose inequivalent embeddings is held by O(n) with respect to the number of its vertices n.

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).

Small vertex-transitive and Cayley graph
Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach
✍ Eyal Loz; Martin Mačaj; Mirka Miller; Jana Ε iagiovΓ‘; Jozef Ε irÑň; Jana TomanovΓ‘ πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 184 KB

We examine the existing constructions of the smallest known vertex-transitive graphs of a given degree and girth 6. It turns out that most of these graphs can be described in terms of regular lifts of suitable quotient graphs. A further outcome of our analysis is a precise identification of which of