Les moments microlocaux et la régularité des solutions de l'équation de Schrödinger
Gain of regularity for equations of KdV type
The set chromatic number of a graph
For a nontrivial connected graph G, let c: V(G)→ N be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) ≠ NC(v) for every pair u,v of adjacent vertices of G. The minimum number of colors required of such a coloring is called the set chromatic number χₛ(G) of G. The set chromatic numbers of some well-known classes of graphs are determined...
Set vertex colorings and joins of graphs
For a nontrivial connected graph , let be a vertex coloring of where adjacent vertices may be colored the same. For a vertex of , the neighborhood color set is the set of colors of the neighbors of . The coloring is called a set coloring if for every pair of adjacent vertices of . The minimum number of colors required of such a coloring is called the set chromatic number . A study is made of the set chromatic number of the join of two graphs and . Sharp lower and upper bounds...
Page 1