Premium
Bounding the number of embeddings of 5‐connected projective‐planar graphs
Author(s) -
Kitakubo Shigeru
Publication year - 1991
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190150207
Subject(s) - mathematics , projective plane , combinatorics , planar graph , bounding overwatch , pencil (optics) , book embedding , discrete mathematics , planar , projective test , graph , 1 planar graph , line graph , pure mathematics , computer science , geometry , mechanical engineering , computer graphics (images) , engineering , artificial intelligence , correlation
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 (⩽120).