Results 31 to 40 of about 9,006,025 (294)
Snarks with total chromatic number 5 [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Gunnar Brinkmann +2 more
doaj +1 more source
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
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
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
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
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 +3 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
Twin-Lever Multifunctional Meta-Optics With High Longitudinal Tolerance. [PDF]
Adv Sci (Weinh)We introduce a single‐layer, CMOS‐compatible metasurface that allows for polarization‐programmable, achromatic broadband dual‐mode imaging with high longitudinal tolerance. The twin‐lever design combines bright‐field focusing and vortex‐based edge‐enhanced imaging while managing axial intensity distribution from 488 to 633 nm.
Javed I +10 more
europepmc +2 more sources
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
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