Results 21 to 30 of about 117,877 (279)
Coloring Sums of Extensions of Certain Graphs [PDF]
, 2016 Recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted by $\chi(G).$ In this paper the concepts of $\chi$'-chromatic sum and $\chi^+$-chromatic sum are introduced. The extended
Bej, Saptarshi, Kok, Johan
core +4 more sources
Graphs with tiny vector chromatic numbers and huge chromatic numbers [PDF]
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003 Summary: \textit{D. Karger, R. Motwani} and \textit{M. Sudan} [J. ACM 45, 246--265 (1998; Zbl 0904.68116)] introduced the notion of a vector coloring of a graph. In particular, they showed that every \(k\)-colorable graph is also vector \(k\)-colorable, and that for constant \(k\), graphs that are vector \(k\)-colorable can be colored by roughly ...
Feige, Uriel +2 more
openaire +2 more sources
On the Locating Chromatic Number of Barbell Shadow Path Graph
Indonesian Journal of Combinatorics, 2021 The locating-chromatic number was introduced by Chartrand in 2002. The locating chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph.
A. Asmiati +2 more
doaj +1 more source
Chromatic Number and Neutrosophic Chromatic Number
, 2021 New setting is introduced to study chromatic number. Neutrosophic chromatic number and chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assigns to the vertices of neutrosophic graphs is applied. Some questions and
openaire +2 more sources
Chromatic-Choosability of Hypergraphs with High Chromatic Number [PDF]
The Electronic Journal of Combinatorics, 2019 It was conjectured by Ohba and confirmed by Noel, Reed and Wu that, for any graph $G$, if $|V(G)|\le 2\chi(G)+1$ then $G$ is chromatic-choosable; i.e., it satisfies $\chi_l(G)=\chi(G)$. This indicates that the graphs with high chromatic number are chromatic-choosable. We observe that this is also the case for uniform hypergraphs and further propose a
Wang, Wei, Qian, Jianguo
openaire +3 more sources
Total dominator chromatic number of Kneser graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Decomposition into special substructures inheriting significant properties is an important method for the investigation of some mathematical structures. A total dominator coloring (briefly, a TDC) of a graph G is a proper coloring (i.e.
Parvin Jalilolghadr, Ali Behtoei
doaj +1 more source
Fuzzy coloring and total fuzzy coloring of various types of intuitionistic fuzzy graphs [PDF]
Notes on IFS, 2023 In this paper, fuzzy coloring and total fuzzy coloring of intuitionistic fuzzy graphs are introduced. The fuzzy chromatic number, fuzzy chromatic index, total fuzzy chromatic number and total fuzzy chromatic index of both vertices and edges in ...
R. Buvaneswari, P. Revathy
doaj +1 more source
0034 | Chromatic Number and Neutrosophic Chromatic Number
, 2021 New setting is introduced to study chromatic number. Neutrosophic chromatic number and chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assigns to the vertices of neutrosophic graphs is applied. Some questions and
openaire +1 more source
Triangle-free intersection graphs of line segments with large chromatic number [PDF]
, 2012 In the 1970s, Erdos asked whether the chromatic number of intersection graphs of line segments in the plane is bounded by a function of their clique number. We show the answer is no.
Arkadiusz Pawlik +20 more
core +1 more source
Chromatic Ramsey number of acyclic hypergraphs [PDF]
, 2015 Suppose that $T$ is an acyclic $r$-uniform hypergraph, with $r\ge 2$. We define the ($t$-color) chromatic Ramsey number $\chi(T,t)$ as the smallest $m$ with the following property: if the edges of any $m$-chromatic $r$-uniform hypergraph are colored with
Gyárfás, András +2 more
core +2 more sources