https://oldena.lpnu.ua/handle/ntb/56819| Title: | List of Non-Outer Projective Planar Graphs |
| Authors: | Petrenjuk, Volodymyr Petrenjuk, Dmytro |
| Affiliation: | Centralukrainian national technical university V. M. Glushkov Institute of Cybernetics of the NAS of Ukraine |
| Bibliographic description (Ukraine): | Petrenjuk 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. |
| Bibliographic description (International): | Petrenjuk 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. |
| Is part of: | Computational linguistics and intelligent systems, 2021 |
| Issue Date: | 4-May-2021 |
| Place of the edition/event: | Львів ; Харків Lviv ; Kharkiv |
| Temporal Coverage: | 22-23 April 2021, Kharkiv |
| Keywords: | Graph representations geometric and topological aspects graph theory projective graph |
| Number of pages: | 12 |
| Page range: | 38-49 |
| Start page: | 38 |
| End page: | 49 |
| Abstract: | The 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. |
| URI: | https://ena.lpnu.ua/handle/ntb/56819 |
| ISSN: | 2523-4013 |
| Copyright owner: | copyrighted 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 and |
| URL for reference material: | https://etd.ohiolink.edu/rws_etd/send_file/send?accession=osu1209141894&disposition=inline http://ceurws.org/Vol-2604/ http://www.mpi-sb.mpg.de/LEDA/ |
| References (Ukraine): | [1] M.P. Khomenko, φ - transformation of graphs. Institute of Mathematics, Kyiv, 1973. [2] D. Archdeacon, N. Hartsfield, C. H. C. Little, B. Mohar, Obstructions sets for outer-projective - planar graphs. Ars Combinatoria, 1998, 49, 113-128. [3] Hur Surkhjin, The Kuratowski covering conjecture for graphs of the order less than 10. Dissertation, The Ohio State University, 2008. URL: https://etd.ohiolink.edu/rws_etd/send_file/send?accession=osu1209141894&disposition=inline [4] Bojan Mohar, Carsten Thomassen, Graphs on surfaces, Johns Hopkins University Press, 2001. [5] Anna Flötotto, Embeddability of graphs into the Klein surface. Dissertation, Universitаt Bielefeldvorgeleg, 2010. [6] V. Petrenjuk, About Transformation graphs as a tool for investigation. Proceedings of the 4th International Conference on Computational Linguistics and Intelligent Systems (COLINS 2020). Volume I: Main Conference Lviv, Ukraine, April 23-24, 2020,1309-1319. URL: http://ceurws.org/Vol-2604/ [7] LEDA: A library of efficient data types and algorithms, Max Planck Institute for Computer Science. URL: http://www.mpi-sb.mpg.de/LEDA/ [8] K. Scott, Outermobius and cylindrical graphs. Senior Thesis, Princeton University, 1997. |
| References (International): | [1] M.P. Khomenko, ph - transformation of graphs. Institute of Mathematics, Kyiv, 1973. [2] D. Archdeacon, N. Hartsfield, C. H. C. Little, B. Mohar, Obstructions sets for outer-projective - planar graphs. Ars Combinatoria, 1998, 49, 113-128. [3] Hur Surkhjin, The Kuratowski covering conjecture for graphs of the order less than 10. Dissertation, The Ohio State University, 2008. URL: https://etd.ohiolink.edu/rws_etd/send_file/send?accession=osu1209141894&disposition=inline [4] Bojan Mohar, Carsten Thomassen, Graphs on surfaces, Johns Hopkins University Press, 2001. [5] Anna Flötotto, Embeddability of graphs into the Klein surface. Dissertation, Universitat Bielefeldvorgeleg, 2010. [6] V. Petrenjuk, About Transformation graphs as a tool for investigation. Proceedings of the 4th International Conference on Computational Linguistics and Intelligent Systems (COLINS 2020). Volume I: Main Conference Lviv, Ukraine, April 23-24, 2020,1309-1319. URL: http://ceurws.org/Vol-2604/ [7] LEDA: A library of efficient data types and algorithms, Max Planck Institute for Computer Science. URL: http://www.mpi-sb.mpg.de/LEDA/ [8] K. Scott, Outermobius and cylindrical graphs. Senior Thesis, Princeton University, 1997. |
| Content type: | Article |
| Appears in Collections: | Computational linguistics and intelligent systems. – 2021 р. |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.