Results 31 to 40 of about 568,500 (305)
The plane-width of graphs [PDF]
Journal of Graph Theory, 2011 Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all such mappings.
Kaminski, Marcin +2 more
openaire +3 more sources
Reflexive edge strength of convex polytopes and corona product of cycle with path
AIMS Mathematics, 2022 For a graph $ G $, we define a total $ k $-labeling $ \varphi $ is a combination of an edge labeling $ \varphi_e(x)\to\{1, 2, \ldots, k_e\} $ and a vertex labeling $ \varphi_v(x) \to \{0, 2, \ldots, 2k_v\} $, such that $ \varphi(x) = \varphi_v(x) $ if ...
Kooi-Kuan Yoong +4 more
doaj +1 more source
Plane Graphs with Parity Constraints [PDF]
Graphs and Combinatorics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aichholzer Oswin +6 more
openaire +3 more sources
Colouring of plane graphs with unique maximal colours on faces [PDF]
, 2015 The Four Colour Theorem asserts that the vertices of every plane graph can be properly coloured with four colors. Fabrici and G\"oring conjectured the following stronger statement to also hold: the vertices of every plane graph can be properly coloured ...
Wendland, Alex
core +2 more sources
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
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
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths [PDF]
, 2018 When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings?
Abel, Zachary +5 more
core +2 more sources
On the edge irregularity strength for some classes of plane graphs
AIMS Mathematics, 2021 Graph labeling is an assignment of (usually) positive integers to elements of a graph (vertices and/or edges) satisfying certain condition(s). In the last two decades, graph labeling research received much attention from researchers.
Ibrahim Tarawneh +3 more
doaj +1 more source
Chains and graphs of Ostrom planes [PDF]
Pacific Journal of Mathematics, 1964 J. D. Swift
openalex +3 more sources
A Penrose polynomial for embedded graphs [PDF]
, 2011 We extend the Penrose polynomial, originally defined only for plane graphs, to graphs embedded in arbitrary surfaces. Considering this Penrose polynomial of embedded graphs leads to new identities and relations for the Penrose polynomial which can not be
Aigner +22 more
core +4 more sources