Results 101 to 110 of about 8,657,296 (197)
The Study of Adaptable Chromatic Number of Graphs
, 2011 計畫編號：NSC99-2115-M032-003研究期間：201008~201107研究經費：297,000一個圖型(或超圖)的著色是適合對給定的邊著色，如果沒有邊和他的兩個端點著同色。ㄧ個圖的適合的著色數是指最小的使得對任意使用個顏色的邊著色都有一個使用相同個顏色的適合的點著色。 GGkkk 過去有關適合著色數的討論，零散的出現在各不同的問題上。有許多結果在各個不同的地方被證明。讓我們對這樣的問題感到興趣，而且這問題和原始的著色定義有很大的關連，所以可以將這問題和原始著色作一些比較 ...
潘志實
core
Bounds for the (m,n)-mixed chromatic number and the oriented chromatic number
, 2013 International audienceWe give new bounds for the (m,n)-mixed chromatic number and the oriented chromatic number of ...
Sopena, Eric +3 more
core +3 more sources
The Chromatic Number of Random Intersection Graphs
Discussiones Mathematicae Graph Theory, 2017 We study problems related to the chromatic number of a random intersection graph G (n,m, p). We introduce two new algorithms which colour G (n,m, p) with almost optimum number of colours with probability tending to 1 as n → ∞. Moreover we find a range of
Rybarczyk Katarzyna
doaj +1 more source
ON THE COMPUTABLE LIST CHROMATIC NUMBER AND COMPUTABLE COLORING NUMBER [PDF]
In this paper, we introduce two new variations on the computable chromatic number: the computable list chromatic number and the computable coloring number.
Thomason, Seth Campbell
core +1 more source
THE LOCATING CHROMATIC NUMBER OF CHAIN(A,4,n) GRAPH
BarekengLet be a connected graph with a vertex coloringsuch that two adjacent vertices have different colors. We denote an ordered partition where is a color class with color-, consisting of vertices given color , for .
Des Welyyanti +2 more
doaj +1 more source
The distinguishing chromatic number
, 2008 . In this paper we define and study the distinguishing chromatic number, χD(G), of a graph G, building on the work of Albertson and Collins who studied the distinguishing number.
Karen L. Collins, Ann, N. Trenk
core
PISOT NUMBERS AND CHROMATIC ZEROS
, 2014 In this article we show that Pisot numbers of even degree and their powers cannot be roots of chromatic polynomials. We also consider the family of smallest Pisot numbers of odd degree. We show that they cannot be roots of chromatic polynomials of connected graphs with a certain maximum number of vertices.
openaire +4 more sources
Game Chromatic Number of Graphs
, 1998 We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic ...
Xuding Zhu, Thomas Dinski
core
Grid representations and the chromatic number
Computational Geometry, 2013 A grid drawing of a graph maps vertices to grid points and edges to line segments that avoid grid points representing other vertices. We show that there is a number of grid points that some line segment of an arbitrary grid drawing must intersect. This number is closely connected to the chromatic number.
openaire +4 more sources
, 2009 A b-colouring of a graph G is a proper colouring of G such that each colour contains a vertex that is adjacent to all other colours and the b-chromatic number χb(G) is the maximum number of colours used in a b-colouring of G.
Maffray, Frédéric +3 more
core +1 more source