Abstract. This article is devoted to the properties of the planar triangula-tions. The conjugated planar triangulation will be introduced and on the base of the properties, which were achieved by the other authors there will be proved some theorems, which will show the properties of the dual triangulations. Also the numeric properties of the dual planar triangulations will be examined for the sake of understanding the interdependences of the cyclimatic numbers of different graphs between themselves. We’ll see how the cyclomatic number of the planar conjugated triangulation depends on the cyclomatic number of the planar triangulation and how its increment depends on the number of the vertexes. These characteristics will be further very impor...
International audienceMaximal $(k+1)$-crossing-free graphs on a planar point set in convex position,...
Let P be a simple polygon with n vertices. The dual graph T⁎ of a triangulation T of P is the graph ...
AbstractIn this paper, we prove that any two triangulations of a given polygon may be transformed in...
Abstract. The attempts to prove the Four Color Problem last for years. A little hope arises that the...
AbstractA graph G is said to be well-covered if every maximal independent set of vertices has the sa...
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polyt...
A $k$-triangulation of a convex polygon is a maximal set of diagonals so that no $k+1$ of them mutua...
AbstractA graph G is said to be well-covered if every maximal independent set of vertices has the sa...
Abstract. A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them...
M.Sc.Within the field of Graph Theory the many ways in which graphs can be coloured have received a ...
Objektif utama projek ini adalah untuk membincangkan pentingnya Graf Planar dan Pewarnaan. Dalam me...
This thesis is based on the article Planarity of Double Vertex Graphs by Y. Alavi, M. Behzad and J...
In this paper, we consider the problem of determining in polynomial time whether a given planar poin...
Collected in this volume are most of the important theorems and algorithms currently known for plana...
In this paper, we consider the problem of determining in polynomial time whether a given planar poin...
International audienceMaximal $(k+1)$-crossing-free graphs on a planar point set in convex position,...
Let P be a simple polygon with n vertices. The dual graph T⁎ of a triangulation T of P is the graph ...
AbstractIn this paper, we prove that any two triangulations of a given polygon may be transformed in...
Abstract. The attempts to prove the Four Color Problem last for years. A little hope arises that the...
AbstractA graph G is said to be well-covered if every maximal independent set of vertices has the sa...
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polyt...
A $k$-triangulation of a convex polygon is a maximal set of diagonals so that no $k+1$ of them mutua...
AbstractA graph G is said to be well-covered if every maximal independent set of vertices has the sa...
Abstract. A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them...
M.Sc.Within the field of Graph Theory the many ways in which graphs can be coloured have received a ...
Objektif utama projek ini adalah untuk membincangkan pentingnya Graf Planar dan Pewarnaan. Dalam me...
This thesis is based on the article Planarity of Double Vertex Graphs by Y. Alavi, M. Behzad and J...
In this paper, we consider the problem of determining in polynomial time whether a given planar poin...
Collected in this volume are most of the important theorems and algorithms currently known for plana...
In this paper, we consider the problem of determining in polynomial time whether a given planar poin...
International audienceMaximal $(k+1)$-crossing-free graphs on a planar point set in convex position,...
Let P be a simple polygon with n vertices. The dual graph T⁎ of a triangulation T of P is the graph ...
AbstractIn this paper, we prove that any two triangulations of a given polygon may be transformed in...