Results 11 to 20 of about 9,006,025 (294)
Tree-Chromatic Number Is Not Equal to Path-Chromatic Number [PDF]
Journal of Graph Theory, 2017 For a graph G and a tree-decomposition (T,B) of G, the chromatic number of (T,B) is the maximum of χ(G[B]), taken over all bags B∈B. The tree-chromatic number of G is the minimum chromatic number of all tree-decompositions (T,B) of G.
Kim, Ringi +3 more
core +5 more sources
Local chromatic number and topology [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The local chromatic number of a graph, introduced by Erdős et al., is the minimum number of colors that must appear in the closed neighborhood of some vertex in any proper coloring of the graph.
Gábor Simonyi, Gábor Tardos
doaj +3 more sources
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.
Henry Garrett
core +2 more sources
Journal of Combinatorial Theory, Series B, 2015 Let us say a graph G has “tree-chromatic number” at most k if it admits a tree-decomposition (T, (X-t : t is an element of V (T))) such that G[X-t] has chromatic number at most k for each t is an element of V (T). This seems to be a new concept, and this
Seymour, Paul D.
core +3 more sources
The b-Chromatic Number of Star Graph Families [PDF]
Le Matematiche, 2010 In this paper, we investigate the b-chromatic number of central graph, middle graph and total graph of star graph, denoted by C(K1,n), M(K1,n) and T(K1,n) respectively.
Vivin J. Vernold, M. Venkatachalam
doaj +2 more sources
On the Locating Chromatic Number of Barbell Shadow Path Graph [PDF]
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 +2 more sources
Weighted graphs: Eigenvalues and chromatic number
Electronic Journal of Graph Theory and Applications, 2016 We revisit Hoffman relation involving chromatic number $\chi$ and eigenvalues. We construct some graphs and weighted graphs such that the largest and smallest eigenvalues $\lambda$ dan $\mu$ satisfy $\lambda=(1-\chi)\mu.$ We study in particular the ...
Charles Delorme
doaj +2 more sources
The open monophonic chromatic number of a graph [PDF]
Journal of Hyperstructures, 2023 A set P of vertices in a connected graph G is called open monophonic chromatic set if P is both an open monophonic set and a chromatic set. The minimum cardinality among the set of all open monophonic chromatic sets is called open monophonic chromatic ...
Mohammed Abdul Khayyoom +1 more
doaj +1 more source
The incidence chromatic number of some graph [PDF]
International Journal of Mathematics and Mathematical Sciences, 2005 The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey (1993). They conjectured that every graph G can be incidence colored with Δ(G)+2 colors.
Liu Xikui, Li Yan
doaj +2 more sources
The Distinguishing Chromatic Number [PDF]
The Electronic Journal of Combinatorics, 2006 In this paper we define and study the distinguishing chromatic number, $\chi_D(G)$, of a graph $G$, building on the work of Albertson and Collins who studied the distinguishing number. We find $\chi_D(G)$ for various families of graphs and characterize those graphs with $\chi_D(G)$ $ = |V(G)|$, and those trees with the maximum chromatic distingushing ...
Karen L. Collins, Ann N. Trenk
openaire +3 more sources