Results 221 to 230 of about 1,370,090 (279)
<i>Blastocystis</i> sp. induces neurocognitive deficits in mice via p38 MAPK-mediated downregulation of NR4A1. [PDF]
Yang X +6 more
europepmc +1 more source
Correction for Meireles et al., Aging populations threaten conservation goals of zoos. [PDF]
europepmc +1 more source
Monitoring anti-Xa levels and thromboelastography in puerperal venous thromboembolism: a prospective cohort study. [PDF]
Ma R, Tao W, Luo W, Zhou Y, Yu M, Xu Z.
europepmc +1 more source
Correction for Waldeck-Weiermair et al., Dynamic regulation of receptor-modulated endothelial NADPH oxidases. [PDF]
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Acta Mathematicae Applicatae Sinica, English Series, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Wei-ling +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Wei-ling +2 more
openaire +1 more source
Graphs and Combinatorics, 1994
``For integers \(k \geq 2\), the \(k\)-line graph of a graph \(G\) is defined as a graph whose vertices correspond to the complete subgraphs on \(k\) vertices in \(G\) with two distinct vertices adjacent if the corresponding complete subgraphs have \(k-1\) common vertices in \(G\).'' Starting with a graph \(G\), one can construct the sequence of graphs
Le Van Bang, Prisner, Erich
openaire +2 more sources
``For integers \(k \geq 2\), the \(k\)-line graph of a graph \(G\) is defined as a graph whose vertices correspond to the complete subgraphs on \(k\) vertices in \(G\) with two distinct vertices adjacent if the corresponding complete subgraphs have \(k-1\) common vertices in \(G\).'' Starting with a graph \(G\), one can construct the sequence of graphs
Le Van Bang, Prisner, Erich
openaire +2 more sources

