Results 71 to 80 of about 196,625 (294)
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background Olfactory dysfunction is frequently observed in patients with multiple sclerosis (MS); however, its underlying mechanisms remain poorly understood. To date, no studies have directly examined the nasal mucosal microbiota in MS. This study aimed to explore potential relationships among olfactory function, nasal microbiota composition,
Zidan Gao +5 more
wiley +1 more source
Altered Dynamic Functional Network Connectivity in Post‐Stroke Aphasia
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Previous studies examining post‐stroke aphasia (PSA) patients via resting‐state functional magnetic resonance imaging (rs‐fMRI) have predominantly focused on static functional connectivity. In contrast, the current investigation aims to elucidate the alterations in dynamic functional network connectivity (dFNC) among PSA patients ...
Guihua Xu +6 more
wiley +1 more source
Negative results on acyclic improper colorings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Raspaud and Sopena showed that the oriented chromatic number of a graph with acyclic chromatic number $k$ is at most $k2^{k-1}$. We prove that this bound is tight for $k \geq 3$.
Pascal Ochem
doaj +1 more source
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3
, 2017 We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables.
Kiefer, Sandra +2 more
core +1 more source
On Drawings and Decompositions of 1-Planar Graphs [PDF]
The Electronic Journal of Combinatorics, 2013 A graph is called 1-planar if it can be drawn in the plane so that each of its edges is crossed by at most one other edge. We show that every 1-planar drawing of any 1-planar graph on $n$ vertices has at most $n-2$ crossings; moreover, this bound is tight.
Dávid Hudák, Július Czap
openaire +2 more sources
The Relationship Between Inflammation and Central Nervous System in Multiple Sclerosis
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Aim Multiple sclerosis is an autoimmune demyelination disease that is seen especially in the young population and has a progressive course, causing motor, sensory, and cognitive deficits. In the literature, the pathogenesis of MS disease and the interconnection between the immune and central nervous system in the disease have not been fully ...
Gamze Ansen +5 more
wiley +1 more source
T-shape visibility representations of 1-planar graphs [PDF]
Computational Geometry, 2018 26 pages, 8 ...
openaire +4 more sources
The Immobilization of Hyaluronic Acid in 3D Hydrogel Scaffolds Modulates Macrophage Polarization
Advanced Biology, EarlyView.This study explores the use of collagen‐hyaluronic acid (HA) hydrogels for the 3D culture of macrophages, providing a useful tool for modelling macrophage behavior in tissues and diseases. It highlights how hydrogel composition, mechanical properties, and preparation methods influence macrophage behavior, revealing for the first time that HA's ...
Tiah CL Oates +7 more
wiley +1 more source
Prime labelings on planar grid graphs
Theory and Applications of Graphs, 2022 It is known that for any prime p and any integer n such that 1≤n≤p there exists a prime labeling on the pxn planar grid graph PpxPn.
Stephen James Curran
doaj +1 more source
Mixed Linear Layouts of Planar Graphs
, 2017 A $k$-stack (respectively, $k$-queue) layout of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing (non-nested) edges with respect to the vertex ordering. In 1992, Heath and Rosenberg conjectured
C Bachmaier +12 more
core +1 more source