Petrenjuk, VolodymyrPetrenjuk, Dmytro2022-05-232022-05-232021-05-042021-05-04Petrenjuk V. List of Non-Outer Projective Planar Graphs / Volodymyr Petrenjuk, Dmytro Petrenjuk // Computational linguistics and intelligent systems, 22-23 April 2021, Kharkiv. — Lviv ; Kharkiv, 2021. — Vol Vol. II : Proceedings of the 5th International conference, COLINS 2021, Workshop, Kharkiv, Ukraine, April 22-23. — P. 38–49.2523-4013https://ena.lpnu.ua/handle/ntb/56819The graph is outer-projective-planar, if embeds on the projective-plane with all vertices on the boundary of one distinguished cell, and non-outer-projective-planar in another case. The main result: diagrams of graphs as a result of the algorithm are given and the numbers of reachability of sets of vertices of minors of the projective plane and sets with points of connection of a star to subgraphs of these minors are calculated. The list of non-outer projective-planar graphs that was declared in [6] has presented here.38-49enGraph representationsgeometric and topological aspects graph theoryprojective graphArticlecopyrighted by its editors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).© 2021 Copyright for the individual papers by the papers’ authors. Copying permitted only for private and academic purposes. This volume is published and12Petrenjuk V. List of Non-Outer Projective Planar Graphs / Volodymyr Petrenjuk, Dmytro Petrenjuk // Computational linguistics and intelligent systems, 22-23 April 2021, Kharkiv. — Lviv ; Kharkiv, 2021. — Vol Vol. II : Proceedings of the 5th International conference, COLINS 2021, Workshop, Kharkiv, Ukraine, April 22-23. — P. 38–49.