On the structure of the planar subgraphs of obstruction graphs of a nonorientable surface with a given genus
Volodymyr Petrenyuk
Source record
Source: Crossref
Published: Sep 4, 2021
DOI: 10.15407/fmmit2021.33.105
Open original source ↗Source abstract
The problem of studying the structure of planar graphs with sets of points, which should be critical concerning the distance between cells on the boundaries of which the elements of a given set are located in operations of removing vertices or edges of a graph, is considered. Knowing the structure of these planar graphs, it is possible to construct a finite set of planar graphs with given characteristics required for the construction of obstruction graphs of a given nonorientable genus. The main result is to use the constructed list of plane graphs critical concerning distance 2 to construct obstruction graphs of a given nonorientable genus.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.