Results 21 to 30 of about 1,353,416 (150)
Entire choosability of near-outerplane graphs [PDF]
, 2008 It is proved that if G is a plane embedding of a K4-minor-free graph with maximum degree Δ, then G is entirely 7-choosable if Δ≤4 and G is entirely (Δ+ 2)-choosable if Δ≥ 5; that is, if every vertex, edge and face of G is given a list of max{7,Δ+2 ...
Timothy J. Hetherington +2 more
core +1 more source
Journal of Graph Algorithms and Applications, 2009 In this paper we give a simple algorithm to generate all connected rooted plane graphs with at most m edges. A rooted" plane graph is a plane graph with one designated (directed) edge on the outer face.
Katsuhisa Yamanaka, Shin-ichi Nakano
doaj +1 more source
Minimal unavoidable sets of cycles in plane graphs [PDF]
Opuscula Mathematica, 2018 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
AKCE International Journal of Graphs and Combinatorics, 2020 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
Box-Rectangular Drawings of Planar Graphs
Journal of Graph Algorithms and Applications, 2013 A plane graph is a planar graph with a fixed planar embedding in the plane. In a box- rectangular drawing of a plane graph, every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line ...
Md. Manzurul Hasan +2 more
doaj +1 more source
Graphic Representation of a Dimensional Expansion of Triangular Fuzzy Number
Journal of Mathematics, 2021 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
Facial rainbow edge-coloring of simple 3-connected plane graphs [PDF]
Opuscula Mathematica, 2020 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
The Neumann problem in graph Lipschitz domain in the plane
, 2022 We study new aspects of the solvability of the classical Neumann boundary value problem in a graph Lipschitz domain in the plane. When the domain is the upper half-plane, the boundary data is assumed to belong to weighted Lebesgue or weighted Lorentz ...
Ortiz Caraballo, Carmen +2 more
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 +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 +17 more
doaj +1 more source