Results 91 to 100 of about 2,201 (118)

Functional rather than effector-specific organization of human posterior parietal cortex. [PDF]

J Neurosci, 2011
Heed T, Beurze SM, Toni I, Röder B, Medendorp WP.   +4 more
europepmc   +1 more source

Special Issue: Abstracts of the 11^th Congress of the European Academy of Neurology, Helsinki, Finland. [PDF]

Eur J Neurol
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Adjacent vertex distinguishing total colorings of outerplanar graphs

Journal of Combinatorial Optimization, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Yiqiao, Wang, Weifan
openaire   +4 more sources

The adjacent vertex distinguishing total coloring of planar graphs

Journal of Combinatorial Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Weifan, Huang, Danjun
openaire   +4 more sources

Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8

Discrete Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang, Yulin, Hu, Jie, Wang, Guanghui, Yu, Xiaowei   +3 more
openaire   +3 more sources

On the adjacent-vertex-strongly-distinguishing total coloring of graphs

Science in China Series A: Mathematics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Zhongfu, Cheng, Hui, Yao, Bing, Li, Jingwen, Chen, Xiangen, Xu, Baogen   +5 more
openaire   +4 more sources

Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9

Discrete Mathematics, 2019
For a simple graph $G$, an adjacent vertex distinguishing (or AVD) total $k$-coloring is a proper total $k$-coloring of $G$ such that any two adjacent vertices have different color sets; a color set for vertex $v$ consisting of the color of $v$ and the colors of its incidence edges.
Jie Hu, Guanghui Wang, Jianliang Wu, Donglei Yang, Xiaowei Yu   +4 more
openaire   +4 more sources

Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree

SCIENTIA SINICA Mathematica, 2012
An adjacent vertex distinguishing total coloring of a graph G is a proper total coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors needed for an adjacent vertex distinguishing total coloring of G is denoted by χa′′( G ).
WeiFan WANG, DanJun HUANG
openaire   +3 more sources

Adjacent vertex distinguishing total coloring in split graphs

Discrete Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Verma, Shaily, Fu, Hung-Lin, Panda, B. S.   +2 more
openaire   +2 more sources

Incidence Adjacent Vertex-Distinguishing Total Coloring of Graphs

2009 International Conference on Computational Intelligence and Software Engineering, 2009
Let G(V, E) be a simple graph,k is a positive integer.f is a mapping from V (G) ∪ E(G) to {1, 2, ··· ,k } such that ∀uv ∈ E(G),then f (u) = f (v); ∀uv, vw ∈ E(G) ,u = w, f(uv) = f (vw); ∀uv ∈ E(G) ,C (u) = C(v),we say that f is the incidence-adjacent vertex distinguishing total coloring of G.The minimum number of k is called the incidence-adjacent ...
Zhongfu Zhang, Zhiwen Wang, Enqiang Zhu, Fei Wen, Jingwen Li   +4 more
openaire   +1 more source