Results 161 to 170 of about 339 (184)
Segmentation of Non-Small Cell Lung Carcinomas: Introducing DRU-Net and Multi-Lens Distortion. [PDF]
J ImagingOskouei S +12 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
SIAM Journal on Discrete Mathematics, 2013Consider a simple graph $G=(V,E)$ and its proper edge coloring $c$ with the elements of the set $\{1,2,\ldots,k\}$ (or any other $k$-element set of real numbers). We say that $c$ is neighbor sum distinguishing if $\sum_{w\in N_G(v)}c(wv)\neq \sum_{w\in N_G(u)}c(wu)$ for every edge $uv\in E$.
Jakub Przybyło
exaly +2 more sources
Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
Journal of Graph Theory, 2014AbstractConsider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v.
Jakub Przybylo, Tsai-Lien Wong
openaire +2 more sources
Strict neighbor-distinguishing edge coloring of planar graphs
SCIENTIA SINICA Mathematica, 2022Jing Puning +3 more
openaire +1 more source
List neighbor sum distinguishing edge coloring of subcubic graphs
Discrete Mathematics, 2018Rong Luo, You Lu, Zhengke Miao
exaly
Neighbor sum distinguishing total coloring of IC-planar graphs
Discrete Mathematics, 2020Lianying Miao
exaly
On the neighbor sum distinguishing total coloring of planar graphs
Theoretical Computer Science, 2016Cunquan Qu, Jian-Liang Wu
exaly
Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
Theoretical Computer Science, 2017Changqing Xu
exaly
Strict Neighbor-Distinguishing Edge-Coloring of IC-Planar Graphs without 4-Cycles
Advances in Applied Mathematicsopenaire +1 more source