Results 1 to 10 of about 119,953 (318)
Tree-chromatic number is not equal to path-chromatic number [PDF]
Journal of Graph Theory, 2016 For a graph $G$ and a tree-decomposition $(T, \mathcal{B})$ of $G$, the chromatic number of $(T, \mathcal{B})$ is the maximum of $\chi(G[B])$, taken over all bags $B \in \mathcal{B}$.
Huynh, Tony, Kim, Ringi
core +3 more sources
DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER [PDF]
Forum of Mathematics, Sigma, 2016 The dichromatic number of a graph $G$ is the maximum integer $k$
BOJAN MOHAR, HEHUI WU
doaj +4 more sources
Chromatic number via Turán number [PDF]
Discrete Mathematics, 2017 A Kneser representation KG(H) for a graph G is a bijective assignment of hyperedges of a hypergraph H to the vertices of G such that two vertices of G are adjacent if and only if the corresponding hyperedges are disjoint. In this paper, we introduce a colored version of the Turan number and use that to determine the chromatic number of some families of
Meysam Alishahi, Hossein Hajiabolhassan
openalex +3 more sources
Game Chromatic Number of Shackle Graphs
JTAM (Jurnal Teori dan Aplikasi Matematika), 2021 Coloring vertices on graph is one of the topics of discrete mathematics that are still developing until now. Exploration Coloring vertices develops in the form of a game known as a coloring game. Let G graph.
Firmansyah Firmansyah, Abdul Mujib
doaj +2 more sources
Chromatic Number of Resultant of Fuzzy Graphs [PDF]
Fuzzy Information and Engineering, 2016 Fuzzy graph coloring techniques are used to solve many complex real world problems. The chromatic number of complement of fuzzy graph is obtained and compared with the chromatic number of the corresponding fuzzy graph.
Anjaly Kishore, M.S. Sunitha
doaj +2 more sources
Game chromatic number of lexicographic product graphs
AKCE International Journal of Graphs and Combinatorics, 2015 In this paper, we determine the exact values of the game chromatic number of lexicographic product of path P2 with path Pn, star K1,n and wheel Wn. Also we give an upper bound for the game chromatic number of lexicographic product of any two simple ...
R. Alagammai, V. Vijayalakshmi
doaj +2 more sources
The b-chromatic number of power graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x i adjacent to a
Brice Effantin, Hamamache Kheddouci
doaj +3 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
Separating tree-chromatic number from path-chromatic number [PDF]
Journal of Combinatorial Theory, Series B, 2019 We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most~$2$ while the path-chromatic number is unbounded. This resolves a problem posed by Seymour.
Fidel Barrera-Cruz +6 more
openaire +3 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 +1 more source