Results 21 to 30 of about 27,939 (295)
Snarks with total chromatic number 5 [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Gunnar Brinkmann +2 more
doaj +1 more source
The fractional chromatic number of triangle-free subcubic graphs [PDF]
, 2014 Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14 / 5. Improving on estimates of Hatami and Zhu and of Lu and Peng, we prove that the fractional chromatic number of any triangle-free ...
Král’, Daniel +5 more
core +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
The harmonious chromatic number of almost all trees [PDF]
, 1995 A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards, Keith
core +1 more source
Generalisasi Bilangan Kromatik Pada Beberapa Kelas Graf Korona
Jurnal Derivat, 2022 For example is a chromatic number with the smallest integer so that the graph has a true vertex coloring with k color. Chromatic number is still an interesting study which is still being studied for its development through graph coloring.
Riduan Yusuf +3 more
doaj +1 more source
On the local distinguishing chromatic number
AKCE International Journal of Graphs and Combinatorics, 2019 The distinguishing number of graphs is generalized in two directions by Cheng and Cowen (local distinguishing number) and Collins and Trenk (Distinguishing chromatic number). In this paper, we define and study the local distinguishing chromatic number of
Omid Khormali
doaj +2 more sources
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 +3 more sources
Discussiones Mathematicae Graph Theory, 2001 Let \(\tau(G)\) denote the number of vertices in a longest path of a graph \(G\). The \(n\)th detour number \(\chi_n(G)\) of a graph \(G\) is the minimum number of colours required to colour the vertices of \(G\) such that no path with more than \(n\) vertices is monocoloured. It is shown that the path partition conjecture, formulated by P. Mihók (see \
Frank Bullock, Marietjie Frick
openaire +1 more source
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
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