Results 61 to 70 of about 8,657,296 (197)
T-Colorings, Divisibility and the Circular Chromatic Number
Discussiones Mathematicae Graph Theory, 2021 Let T be a T -set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T -edge spans espT (G) and espd⊙T(G), where d is a positive integer and d⊙T={0≤t≤d(maxT+1):d|t⇒t/d∈T}.d \odot T =
Janczewski Robert +2 more
doaj +1 more source
Bounds on the complex zeros of (Di)Chromatic polynomials and Potts-model partition functions [PDF]
, 2001 We show that there exist universal constants C(r) such that, for all loopless graphs G of maximum degree less than or equal to r, the zeros (real or complex) of the chromatic polynomial P-G(q) lie in the disc \q\ 7.963907r.
Sokal, AD
core
Advances in Mathematics, 1999 From the article: We consider graphs \({\mathcal G}=(X,R)\) where the vertex set \(X\) is a standard Borel space (i.e., a complete separable metrizable space equipped with its \(\sigma\)-algebra of Borel sets), and the edge relation \(R\subseteq X^2\) is ``definable,'' i.e., Borel, analytic, coanalytic, etc.
Kechris, A. S. +2 more
openaire +3 more sources
Chromatic number of Euclidean plane [PDF]
, 2023 If the chromatic number of Euclidean plane is larger than four, but it is known that the chromatic number of planar graphs is equal to four, then how does one explain it? In my opinion, they are contradictory to each other. This idea leads to confirm the
Wang, Kai-Rui
core +1 more source
Hamiltonian Chromatic Number of Trees [PDF]
, 2020 This is a final version appeared in proceedings of RAGT 2019 ...
Devsi Bantva, Samir Vaidya
openaire +2 more sources
Locating-Chromatic Number of Bipartite Graphs
مجلة بغداد للعلومThe locating-chromatic number of a graph combines proper vertex coloring with vertex identification through distances to color classes. Although this parameter has been studied for many graph families, general results for bipartite graphs remain limited.
Dian Kastika Syofyan +5 more
doaj +1 more source
Interactions between luminance and colour signals : effects on shape [PDF]
, 2013 This research was supported by the Engineering and Physical Sciences Research Council (EPSRC).Although luminance and color are thought to be processed independently at early stages of visual processing, there is evidence that they interact at later ...
Harris, Julie +2 more
core +1 more source
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 +1 more source
Journal of Symbolic Logic, 2008 AbstractWe show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three. In particular, this holds for the graph of the unilateral shift on [ℕ]ℕ, although its Borel chromatic number is ℵ0.
openaire +3 more sources
On the Chromatic Number of Random Graphs
Journal of Combinatorial Theory, Series B, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amin Coja-Oghlan +2 more
openaire +2 more sources