Results 11 to 20 of about 82,884 (244)
Special Type Routing Problems in Plane Graphs
We considered routing problems for plane graphs to solve control problems of cutting machines in the industry. According to the cutting plan, we form its homeomorphic image in the form of a plane graph G.
Tatiana Makarovskikh, Anatoly Panyukov
doaj +1 more source
Bend-optimal orthogonal drawings of triconnected plane graphs
A drawing of a plane graph G in which each edge is represented by a sequence of alternating horizontal and vertical line segments is called an orthogonal drawing.
Siddharth Bhatia, Kunal Lad, Rajiv Kumar
doaj +2 more sources
Facial rainbow edge-coloring of simple 3-connected plane graphs [PDF]
A facial rainbow edge-coloring of a plane graph \(G\) is an edge-coloring such that any two edges receive distinct colors if they lie on a common facial path of \(G\).
Július Czap
doaj +1 more source
Counting Plane Graphs: Cross-Graph Charging Schemes [PDF]
We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have recently been used to obtain various properties of triangulations that are embedded in a fixed set of points in the plane.
Sharir, Micha, Sheffer, Adam
openaire +4 more sources
Graphic Representation of a Dimensional Expansion of Triangular Fuzzy Number
We calculate Zadeh’s max-min composition operators for two 3-dimensional triangular fuzzy numbers. We prove that if the 3-dimensional result is limited to 2 dimensions, it is the same as the 2-dimensional result, which is shown as a graph.
Yong Sik Yun
doaj +1 more source
Looseness of Plane Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Czap, Július +3 more
openaire +3 more sources
A Survey on the Cyclic Coloring and its Relaxations
A cyclic coloring of a plane graph is a vertex coloring such that any two vertices incident with the same face receive distinct colors. This type of coloring was introduced more than fifty years ago, and a lot of research in chromatic graph theory was ...
Czap Július +2 more
doaj +1 more source
BgNet: Classification of benign and malignant tumors with MRI multi-plane attention learning
ObjectivesTo propose a deep learning-based classification framework, which can carry out patient-level benign and malignant tumors classification according to the patient’s multi-plane images and clinical information.MethodsA total of 430 cases of spinal
Hong Liu +17 more
doaj +1 more source
Minimal unavoidable sets of cycles in plane graphs [PDF]
A set \(S\) of cycles is minimal unavoidable in a graph family \(\cal{G}\) if each graph \(G \in \cal{G}\) contains a cycle from \(S\) and, for each proper subset \(S^{\prime}\subset S\), there exists an infinite subfamily \(\cal{G}^{\prime}\subseteq\cal{
Tomáš Madaras, Martina Tamášová
doaj +1 more source
-shaped point set embeddings of high-degree plane graphs
A point set embedding of a given plane graph on a given point set on a plane is a drawing of where each vertex is drawn on a point in . An orthogonal point set embedding of a plane graph is a point set embedding of such that each edge is drawn as a ...
Shaheena Sultana, Md. Saidur Rahman
doaj +1 more source

