## 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
Characterization of projective graphs
β Scribed by Alan P Sprague
- Publisher
- Elsevier Science
- Year
- 1978
- Tongue
- English
- Weight
- 388 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We construct a family of 4-chromatic graphs which embed on the projective plane, and characterize the edge-critical members. The family includes many well known graphs, and also a new sequence of graphs, which serve to improve Gallai's bound on the length of the shortest odd circuit in a 4-chromatic
## Abstract We show that all graphs with a simple extension property are projective. As a consequence of this result we settle in the affirmative a conjecture of Larose and Tardif and characterize all homogeneous graphs which are projective. Β© 2004 Wiley Periodicals, Inc. J Graph Theory 47: 81β86,
We investigate the structure of the free amalgamated product P 1 \* P 1 β©P 2 P 2 in which P 1 and P 2 are isomorphic projective linear groups and P 1 β© P 2 is a one-point stabilizer in the natural action of P i on the points of a projective space of dimension n β₯ 2. We apply the results to graphs ad
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.
## Abstract The orientable genus is determined for any graph that embeds into the projective plane, Ξ£, to be essentially half of the representativity of any embedding into Ξ£. In addition, a structure is given for any 3βconnected projective planar graph as the union of a spanning planar graph and a