List of Non-Outer Projective Planar Graphs

Simple item page
dc.citation.epage49
dc.citation.spage38
dc.contributor.affiliationCentralukrainian national technical university
dc.contributor.affiliationV. M. Glushkov Institute of Cybernetics of the NAS of Ukraine
dc.contributor.authorPetrenjuk, Volodymyr
dc.contributor.authorPetrenjuk, Dmytro
dc.coverage.placenameЛьвів ; Харків
dc.coverage.placenameLviv ; Kharkiv
dc.coverage.temporal22-23 April 2021, Kharkiv
dc.date.accessioned2022-05-23T10:50:17Z
dc.date.available2022-05-23T10:50:17Z
dc.date.created2021-05-04
dc.date.issued2021-05-04
dc.description.abstractThe 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.
dc.format.extent38-49
dc.format.pages12
dc.identifier.citationPetrenjuk 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.
dc.identifier.citationenPetrenjuk 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.
dc.identifier.issn2523-4013
dc.identifier.urihttps://ena.lpnu.ua/handle/ntb/56819
dc.language.isoen
dc.relation.ispartofComputational linguistics and intelligent systems, 2021
dc.relation.references[1] M.P. Khomenko, φ - transformation of graphs. Institute of Mathematics, Kyiv, 1973.
dc.relation.references[2] D. Archdeacon, N. Hartsfield, C. H. C. Little, B. Mohar, Obstructions sets for outer-projective - planar graphs. Ars Combinatoria, 1998, 49, 113-128.
dc.relation.references[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
dc.relation.references[4] Bojan Mohar, Carsten Thomassen, Graphs on surfaces, Johns Hopkins University Press, 2001.
dc.relation.references[5] Anna Flötotto, Embeddability of graphs into the Klein surface. Dissertation, Universitаt Bielefeldvorgeleg, 2010.
dc.relation.references[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/
dc.relation.references[7] LEDA: A library of efficient data types and algorithms, Max Planck Institute for Computer Science. URL: http://www.mpi-sb.mpg.de/LEDA/
dc.relation.references[8] K. Scott, Outermobius and cylindrical graphs. Senior Thesis, Princeton University, 1997.
dc.relation.referencesen[1] M.P. Khomenko, ph - transformation of graphs. Institute of Mathematics, Kyiv, 1973.
dc.relation.referencesen[2] D. Archdeacon, N. Hartsfield, C. H. C. Little, B. Mohar, Obstructions sets for outer-projective - planar graphs. Ars Combinatoria, 1998, 49, 113-128.
dc.relation.referencesen[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
dc.relation.referencesen[4] Bojan Mohar, Carsten Thomassen, Graphs on surfaces, Johns Hopkins University Press, 2001.
dc.relation.referencesen[5] Anna Flötotto, Embeddability of graphs into the Klein surface. Dissertation, Universitat Bielefeldvorgeleg, 2010.
dc.relation.referencesen[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/
dc.relation.referencesen[7] LEDA: A library of efficient data types and algorithms, Max Planck Institute for Computer Science. URL: http://www.mpi-sb.mpg.de/LEDA/
dc.relation.referencesen[8] K. Scott, Outermobius and cylindrical graphs. Senior Thesis, Princeton University, 1997.
dc.relation.urihttps://etd.ohiolink.edu/rws_etd/send_file/send?accession=osu1209141894&disposition=inline
dc.relation.urihttp://ceurws.org/Vol-2604/
dc.relation.urihttp://www.mpi-sb.mpg.de/LEDA/
dc.rights.holdercopyrighted by its editors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
dc.rights.holder© 2021 Copyright for the individual papers by the papers’ authors. Copying permitted only for private and academic purposes. This volume is published and
dc.subjectGraph representations
dc.subjectgeometric and topological aspects graph theory
dc.subjectprojective graph
dc.titleList of Non-Outer Projective Planar Graphs
dc.typeArticle

Files

Original bundle

Now showing 1 - 2 of 2
Thumbnail Image
Name:
2021vVol_II___Proceedings_of_the_5th_International_conference_COLINS_2021_Workshop_Kharkiv_Ukraine_April_22-23_Petrenjuk_V-List_of_Non_Outer_Projective_38-49.pdf
Size:
2.13 MB
Format:
Adobe Portable Document Format
Download
Thumbnail Image
Name:
2021vVol_II___Proceedings_of_the_5th_International_conference_COLINS_2021_Workshop_Kharkiv_Ukraine_April_22-23_Petrenjuk_V-List_of_Non_Outer_Projective_38-49__COVER.png
Size:
1.13 MB
Format:
Portable Network Graphics
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.77 KB
Format:
Plain Text
Description:
Download

Collections

Computational linguistics and intelligent systems. – 2021 р.