Results 61 to 70 of about 196,625 (294)
Some Results On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
, 2009 A greedy embedding of a graph $G = (V,E)$ into a metric space $(X,d)$ is a function $x : V(G) \to X$ such that in the embedding for every pair of non-adjacent vertices $x(s), x(t)$ there exists another vertex $x(u)$ adjacent to $x(s)$ which is closer to $
A. Kelmans +13 more
core +2 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objectives Repetitive transcranial magnetic stimulation (rTMS) is a non‐invasive brain stimulation strategy with a demonstrated potential to reinforce the residual pathways after a spinal cord injury (SCI). A preclinically tested high‐frequency (15 Hz) rTMS (15 Hz rTMS) protocol was shown to induce corticospinal tract axon regeneration growth ...
Nabila Brihmat +8 more
wiley +1 more source
Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
Discussiones Mathematicae Graph Theory, 2021 A proper [k]-total coloring c of a graph G is a proper total coloring c of G using colors of the set [k] = {1, 2, . . . , k}. Let p(u) denote the product of the color on a vertex u and colors on all the edges incident with u.
Dong Aijun, Li Tong
doaj +1 more source
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs [PDF]
, 2013 A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp.
Evans, William +5 more
core
Recognizing and Drawing IC-planar Graphs
, 2015 IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs.
C Auer +27 more
core +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Autosomal dominant progranulin (GRN) pathogenic variants are a genetic cause of frontotemporal lobar degeneration. Though clinical trials for GRN‐related therapies are underway, there is an unmet need for biomarkers that can predict symptom onset and track disease progression.
Taru M. Flagan +46 more
wiley +1 more source
Discrete Mathematics & Theoretical Computer ScienceNot every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the
Patrizio Angelini +10 more
doaj +1 more source
Structure of Projective Planar Subgraphs of the Graph Obstructions for Fixed Surface
Кібернетика та комп'ютерні технології, 2022 Consider the problem of studying the metric properties of a subgraph G \ v, where v is an arbitrary vertex of obstruction graphs G of a nonorientable genus, which will determine the sets of points of attachment of one subgraph to another and allow ...
Volodymyr Petrenjuk +2 more
doaj +1 more source
Near-colorings: non-colorable graphs and NP-completeness [PDF]
, 2013 A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1
Montassier, Mickael, Ochem, Pascal
core
, 2017 We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with nice convex drawings: outer $k$-planar graphs, where each edge is crossed by at
AWM Dress +23 more
core +1 more source