Results 261 to 270 of about 919,306 (297)

Identification of key genes and diagnostic model associated with circadian rhythms and Parkinson's disease by bioinformatics analysis. [PDF]

Front Aging Neurosci
Zhang J, Ma X, Li Z, Liu H, Tian M, Wen Y, Wang S, Wang L.   +7 more
europepmc   +1 more source

Combining bulk and scRNA-seq to explore the molecular mechanisms governing the distinct efferocytosis activities of a macrophage subpopulation in PDAC. [PDF]

J Cell Mol Med
Zhu S, Cheng Q, Zou M, Li C, Tang Y, Xia L, Jiang Y, Gong Z, Tang Z, Tang Y, Luo H, Peng N, Wang X, Dong X.   +13 more
europepmc   +1 more source

Inhibition of cysteine-serine-rich nuclear protein 1 ameliorates ischemia-reperfusion injury during liver transplantation in an MAPK-dependent manner. [PDF]

Mol Biomed
Wang Z, Ge W, Zhong X, Tong S, Zheng S, Xu X, Wang K.   +6 more
europepmc   +1 more source

Overexpression of RAD54L attenuates osteoarthritis by suppressing the HIF-1α/VEGF signaling pathway: Bioinformatics analysis and experimental validation. [PDF]

PLoS One
Li Z, Xie L, Zou L, Xiao S, Tao J.
europepmc   +1 more source

Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth

Journal of Graph Theory, Volume 110, Issue 3, Page 351-365, November 2025.
Even‐hole‐free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer and a graph , every even‐hole‐free graph of large enough
Sepehr Hajebi
semanticscholar   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On the chordality of a graph

Journal of Graph Theory, 1993
AbstractThe chordality of a graph G = (V, E) is defined as the minimum k such that we can write E = E1 ∩ … ∩ Ek with each (V, Ei) a chordal graph. We present several results bounding the value of this generalization of boxicity. Our principal result is that the chordality of a graph is at most its tree width.
Terry A. McKee, Edward R. Scheinerman
openaire   +2 more sources

On the Hyperbolicity of Chordal Graphs

Annals of Combinatorics, 2001
The hyperbolicity of a metric space is the infimum of all \(\delta\) for which \(d(x,y)+ d(u,v)\leq \max\{d(x, u)+ d(y,v), d(x,v)+ d(y,u)\}+ \delta\) for all elements \(x\), \(y\), \(u\), \(v\) from the space. The notion can be viewed as expressing how `tree like' the space is, as spaces with hyperbolicity \(0\) are precisely the metric trees.
Brinkmann, Gunnar, Koolen, Jack H., Moulton, V.   +2 more
openaire   +3 more sources

Centers of chordal graphs [PDF]

Graphs and Combinatorics, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Rotation Averaging with the Chordal Distance: Global Minimizers and Strong Duality

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021
In this paper we explore the role of duality principles within the problem of rotation averaging, a fundamental task in a wide range of applications.
Anders P. Eriksson, Carl Olsson, Fredrik Kahl, Tat-Jun Chin   +3 more
semanticscholar   +1 more source