Results 11 to 20 of about 20,911 (165)
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
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 +1 more source
Snarks with total chromatic number 5 [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Gunnar Brinkmann +2 more
doaj +1 more source
On the dominated chromatic number of certain graphs [PDF]
Transactions on Combinatorics, 2020 Let $G$ be a simple graph. The dominated coloring of $G$ is a proper coloring of $G$ such that each color class is dominated by at least one vertex.
Saeid Alikhani, Mohammad Reza Piri
doaj +1 more source
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
DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER
Forum of Mathematics, Sigma, 2016 The dichromatic number of a graph $G$ is the maximum integer $k$
BOJAN MOHAR, HEHUI WU
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 +3 more sources
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
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