Ping Zhang.The set chromatic number of a graph.Discussiones Mathematicae Graph Theory. 2009CHARTRAND G,OKAMOTO F,RASMUSSEN C W. The set chromatic number of a graph[J].Discussions Mathematicae Graphics Theory,2009,(03):545-561.G. Chartrand, F. Okamoto, C.W. Rasmussen, and P. Zhang, The ...
The total dominator chromatic (TDC) number x_d~t(G) of G, is the minimum number of colors among all total dominator coloring of G. The neighbourhood corona of two graphs G_1 and G_2 is denoted by G_1 * G_2 and is the graph obtained by taking one copy of G_1 and | V(G_1...
Let G G G be a simple graph. A total dominator coloring of G G G , is a proper coloring of the vertices of G G G in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic (TDC) number \\chi_d^t(G) \\chi_d^t(G) of...
Consider the random graph G(n,p) where every two vertices in the graph are connected randomly and independently with probability p. Denote G∼G(n,p) if G is generated in this way. The chromatic number χ(G) of a graph G means how many colors are needed to vertex-color it....
Department of Mathematical SciencesUniversity of Alaska Fairbanks. FairbanksDISCRETE MATHEMATICSJ. Gimbel and C. Hartman, Subcolorings and the subchromatic number of a graph. Discrete Math., 272 (2003), 139-154.J. Gimbel and C. Hartman, Subcolorings and the subchromatic number of a graph, ...
Hence, we could equivalently define the subchromatic number to be the minimum number of sets needed to partition the vertex set so that no set induces a path of length two. This is closely related to the 2-chromatic number discussed in [5], [21]. The 2-chromatic number of a graph G...
The Interleaved Multichromatic Number of a Graph. Annals of Combinatorics 6, 249–256 (2002). https://doi.org/10.1007/s000260200001 Download citation Issue DateDecember 2002 DOIhttps://doi.org/10.1007/s000260200001 Mathematics Subject Classification2000: 05C15¶Key words and phrases: chromatic ...
CNRS 15 Quai A. France ParisJournal of Graph TheoryPeter Frankl. On the chromatic number of the general Kneser-graph. Journal of Graph Theory, 9(2):217- 220, 1985.On the chromatic number of the general Kneser-graph - Frankl - 1985 () Citation Context ...-set is the set of n-...
the case that the edge probability p is a fixed constant. For sparse random graphs much more is known. For example, Achlioptas and Naor [1] proved that for every d>0, the chromatic number of the random graph Gn,d/n is with high probability either k or k+1, where k is the ...
The Distinguishing Chromatic Number of Kneser Graphs A labeling $f: V(G) ightarrow \\{1, 2, \\ldots, d\\}$ of the vertex set of a graph $G$ is said to be proper $d$-distinguishing if it is a proper coloring o... Z Che,KL Collins - 《Electronic Journal of Combinatorics》 被...