Results 181 to 190 of about 65,626 (208)

Diagnostic value of C-reactive protein-albumin-lymphocyte index in breast cancer cases. [PDF]

Front Oncol
Algin MC, Kılıç MÖ, Salış M, Arik O, Kalayci O, Erdogan B, Uncu A, Abishov R, Bayram UB.   +8 more
europepmc   +1 more source

Cannabis Use Disorder and Postoperative Pain: Elevated Analgesic Requirements After Surgical Repair of Hand Fractures. [PDF]

Plast Reconstr Surg Glob Open
Vallurupalli M, Miao XC, Mehta Y, Pakvasa M, Shah ND, Wang E, Vyas RM.   +6 more
europepmc   +1 more source

iAODE for benchmarking and continuum modeling of single-cell chromatin accessibility. [PDF]

Commun Biol
Fu Z, Chen C, Wang S, Wang J, Chen S.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Local Neighbor-Distinguishing Index of Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weifan Wang, Yiqiao Wang, Wang Yiqiao
exaly   +4 more sources

Strict Neighbor-Distinguishing Index of Subcubic Graphs

Graphs and Combinatorics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weifan Wang, Yiqiao Wang, Wang Yiqiao
exaly   +4 more sources

Strict Neighbor-Distinguishing Total Index of Graphs

Acta Mathematica Sinica, English Series, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gu, Jing, Wang, Wei Fan, Wang, Yi Qiao
exaly   +4 more sources

On Neighbor-Distinguishing Index of Planar Graphs

Journal of Graph Theory, 2014
Summary: A proper edge coloring of a graph \(G\) without isolated edges is neighbor-distinguishing if any two adjacent vertices have distinct sets consisting of colors of their incident edges. The neighbor-distinguishing index of \(G\) is the minimum number \(\mathrm{ndi}(G)\) of colors in a neighbor-distinguishing edge coloring of \(G\).
Weifan Wang, Mirko Horňák, Danjun Huang   +2 more
exaly   +4 more sources

Strict neighbor-distinguishing index of outerplanar graphs

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weifan Wang, Yiqiao Wang, Jingjing Huo   +2 more
exaly   +4 more sources

Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs

Discrete Mathematics, 2020
Let G = ( V , E ) be a simple graph and ϕ : E ( G ) → { 1 , 2 , … , k } be a proper k -edge coloring of G . We say that ϕ is neighbor sum (set) distinguishing if for each edge u v ∈ E ( G ) , the sum (set) of colors taken on the edges incident with u is ...
Jian-Liang Wu
exaly   +2 more sources