Results 31 to 40 of about 1,410,460 (300)

Surface Embeddability of Graphs via Reductions [PDF]

, 2011
On the basis of reductions, polyhedral forms of Jordan axiom on closed curve in the plane are extended to establish characterizations for the surface embeddability of a ...
Liu, Yanpei
core   +1 more source

Generating All Triangulations of Plane Graphs

Journal of Graph Algorithms and Applications, 2011
In this paper, we deal with the problem of generating all triangulations of plane graphs. We give an algorithm for generating all triangulations of a triconnected plane graph G of n vertices.
Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-ichi Nakano   +2 more
doaj   +1 more source

BgNet: Classification of benign and malignant tumors with MRI multi-plane attention learning

Frontiers in Oncology, 2022
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, Meng-Lei Jiao, Meng-Lei Jiao, Xiao-Ying Xing, Han-Qiang Ou-Yang, Han-Qiang Ou-Yang, Han-Qiang Ou-Yang, Yuan Yuan, Jian-Fang Liu, Yuan Li, Chun-Jie Wang, Ning Lang, Yue-Liang Qian, Liang Jiang, Liang Jiang, Liang Jiang, Hui-Shu Yuan, Xiang-Dong Wang   +17 more
doaj   +1 more source

Orthogonal Drawings of Plane Graphs Without Bends

Journal of Graph Algorithms and Applications, 2003
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which the drawing of an edge changes its direction.
Md. Saidur Rahman, Takao Nishizeki, Mahmuda Naznin   +2 more
doaj   +1 more source

Improved Bounds for Some Facially Constrained Colorings

Discussiones Mathematicae Graph Theory, 2023
A facial-parity edge-coloring of a 2-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd number of edges of each color. A facial-parity vertex-coloring of a 2-connected plane graph is a proper
Štorgel Kenny
doaj   +1 more source

Minimum-Area Drawings of Plane 3-Trees

Journal of Graph Algorithms and Applications, 2011
A straight-line grid drawing of a plane graph G is a planar drawing of G, where each vertex is drawn at a grid point of an integer grid and each edge is drawn as a straight-line segment.
Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Muhammad Jawaherul Alam   +3 more
doaj   +1 more source

Invariants of Graph Drawings in the Plane [PDF]

Arnold Mathematical Journal, 2020
48 pages, many figures.
openaire   +4 more sources

An extension of a cubic 2-connected plane graph G to a hamiltonian plane graph contained in G^{2} [PDF]

, 2023
Let $G$ be a simple cubic 2-connected plane graph. For every $2$-factor $X$ of $G$ having $n$-components there exists a simple hamiltonian plane graph $J \subset G^{2}$ such that $|E(J)|= |E(G)| + 2n -2$ and $\Delta(J) \leqslant 5$.Comment: 5 pages, 2 ...
Florek, Jan
core  

The total face irregularity strength of some plane graphs

AKCE International Journal of Graphs and Combinatorics, 2020
A face irregular total -labeling of a 2-connected plane graph is a labeling of vertices and edges such that their face-weights are pairwise distinct. The weight of a face under a labeling is the sum of the labels of all vertices and edges surrounding ...
Meilin I. Tilukay, A.N.M. Salman, Venn Y.I. Ilwaru, F.Y. Rumlawang   +3 more
doaj   +1 more source

A plane graph representation of triconnected graphs

Theoretical Computer Science, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi   +2 more
openaire   +2 more sources