English
Related papers

Related papers: Planar graphs as distinguished graph of Morse flow…

200 papers

To investigate the topological structure of Morse flows on the 2-disk we use the planar graphs as destinguished graph of the flow. We assume, that the flow is transversal to the boundary of the 2-disk. We give a list of all planar graph…

Geometric Topology · Mathematics 2024-02-06 Oleksandr Pryshliak

To investigate the topological structure of Morse flows with a sink on the 2-sphere we use the planar tree as complete topological invariant of the flow. We give a list of all planar tree with at least 7 edges. We use a list of rooted…

Dynamical Systems · Mathematics 2023-05-03 Oleksandr Pryshliak

We investigate topological propeties of flows with one singular point and without closed orbits on the 2-dimensional disk. To classify such flows, destingueshed graph is used, which is a two-colored rooted tree imbedded in the plane. We…

Dynamical Systems · Mathematics 2023-04-04 Alexandr Prishlyak , Serhii Stas

We describe all possible topological structures of Morse flows and typical gradient saddle-nod bifurcation of flows on the 2-dimensional torus with a hole in the case that the number of singular point of flows is at most six. To describe…

Dynamical Systems · Mathematics 2024-04-04 Maria Loseva , Alexandr Prishlyak , Kateryna Semenovych , Dariia Synieok

We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in both drawings are geodesics, our algorithm computes a…

Computational Geometry · Computer Science 2020-07-17 Erin Wolf Chambers , Jeff Erickson , Patrick Lin , Salman Parsa

It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…

Computational Geometry · Computer Science 2019-09-05 Michael Hoffmann , Csaba D. Tóth

A graph is $2$-planar if it has local crossing number two, that is, it can be drawn in the plane such that every edge has at most two crossings. A graph is maximal $2$-planar if no edge can be added such that the resulting graph remains…

Combinatorics · Mathematics 2023-03-16 Michael Hoffmann , Meghana M. Reddy

The paper is devoted to the study of topological properties, structure and classification of Morse flows with fixed points on the boundary of three-dimensional manifolds. We construct a complete topological invariant of a Morse flow,…

Geometric Topology · Mathematics 2022-09-12 Svitlana Bilun , Alexandr Prishlyak , Andrii Prus

We investigate the topological structure of flows on the Girl's surfaces which is one of two possible immersions of the projective plane in three-dimensional space with one triple point of the selfintersection. First, we describe the…

Dynamical Systems · Mathematics 2022-08-23 Maria Loseva , Alexandr Prishlyak

We describe all possible topological structures of Morse-Smale flows without closed trajectories on a three-dimensional sphere, which have two sources, two sinks, one saddle of Morse index 1, one saddle of Morse index 2, and no more than 10…

Geometric Topology · Mathematics 2022-09-27 Svitlana Bilun , Alexandr Prishlyak

In a planar L-drawing of a directed graph (digraph) each edge e is represented as a polyline composed of a vertical segment starting at the tail of e and a horizontal segment ending at the head of e. Distinct edges may overlap, but not…

Computational Geometry · Computer Science 2020-08-19 Patrizio Angelini , Steven Chaplick , Sabine Cornelsen , Giordano Da Lozzo

We describe all possible topological structures of typical one-parameter bifurcations of gradient flows on the 2-sphere with holes in the case that the number of singular point of flows is at most six. To describe structures, we separatrix…

Dynamical Systems · Mathematics 2026-01-13 Illia Ovtsynov , Alexandr Prishlyak

A topological graph is a graph drawn in the plane. A topological graph is $k$-plane, $k>0$, if each edge is crossed at most $k$ times. We study the problem of partitioning the edges of a $k$-plane graph such that each partite set forms a…

Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of…

Computational Geometry · Computer Science 2021-05-28 Patrizio Angelini , Michael A. Bekos , Fabrizio Montecchiani , Maximilian Pfister

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

Computational Geometry · Computer Science 2017-03-21 Michael A. Bekos , Michael Kaufmann , Chrysanthi N. Raftopoulou

Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…

Combinatorics · Mathematics 2024-08-01 Sergey Kurapov , Maxim Davidovsky

We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…

Computational Geometry · Computer Science 2017-08-10 Alfredo García , Ferran Hurtado , Matias Korman , Inês Matos , Maria Saumell , Rodrigo I. Silveira , Javier Tejel , Csaba D. Tóth

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

Combinatorics · Mathematics 2021-08-23 C. M. Mynhardt , A. K. Wright

We construct a topological invariant for a Morse-Smale flow on a 3-manifold and prove that the flows are topologically equivalent iff their invariants are same.

Dynamical Systems · Mathematics 2007-05-23 Alexandr Prishlyak

Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of the last property leads…

Dynamical Systems · Mathematics 2017-06-07 Vladislav Kruglov , Dmitry Malyshev , Olga Pochinka
‹ Prev 1 2 3 10 Next ›