1.1 图色数chromatic number简介 图色数(英语:chromatic number),也被称为 顶点色数(vertex chromatic number),指将一张图上的每个顶点染色,使得相邻的两个点颜色不同,最小需要的颜色数。最小染色数用 {\displaystyle \chi (G)} 表示。 例子: Petersen graph的染色数是3. Petersen graph 记为P 分析 图中提供...
We survey some results and problems on the chromatic number of a graph: The 4-color problem and its extension to other surfaces, some specific graphs for which the chomatic number is hard, the computational complexity, and some recent results and problems on the chromatic polynomial and list ...
chromatic number (mathematics) The smallest number of colours necessary to colour the nodes of agraphso that no two adjacent nodes have the same colour. See also:four colour map theorem. Graph Theory Lessons. Eric Weisstein's World Of Mathematics. ...
Stahl, S. (1996), Note on the nth chromatic numbers of the Grötzsch graph. J. Graph Theory, 21: 207–209. doi: 10.1002/(SICI)1097-0118(199602)21:2<207::AID-JGT10>3.0.CO;2-G Author Information Department of Mathematics, University of Kansas, Lawrence, Kansas 66045 *Department of ...
Given integers k, n, 2 n0(k) the chromatic number of this graph is (k - 1)() + rs, where n = (k - 1)s + r, 0 ≤ r < k - 1.P. FranklCNRS 15 Quai A. France ParisJournal of Graph TheoryP. Frankl, On the chromatic number of the general Kneser-graph, J. Graph Theory...
The chromatic number χ(Gn,p), which is the minimum number of colors needed to color the vertices of the graph Gn,p, such that no two adjacent vertices are colored the same, is one of the most studied parameters in the theory of random graphs, see e.g. [8], [11], [3], [12]...
Ulman, Fractional Graph Theory, A Rational Approach to the Theory of Graphs, Wiley, New York, 1997. [8] C. van Nuffelen, A bound for the chromatic number of a graph, Amer. Math. Monthly 83 (1976) 265–266. [9] V.G. Vizing, Coloring the vertices of a graph in prescribed colors...
Graph TheoryColoringsColoring gameCombinatorial gamesGame chromatic numberCaterpillar; 机译:图论着色着色游戏组合游戏游戏色数卡特彼勒; 入库时间 2022-08-18 10:01:04 相似文献 外文文献 中文文献 专利 1. The difference between game chromatic number and chromatic number of graphs [J] . Matsumoto Nao...
P. Erdős, Graph theory and probability,Canad. J. Math.,11(1959), pp. 34–38. Google Scholar P. ErdősandA. Hajnal, On chromatic number of graphs and set-systems,Acta Math. Acad. Sci. Hung.,17(1966), pp. 61–99. Google Scholar ...
J Graph Theory 21:73–82 Google Scholar Wang H, The adjacent vertex-distinguishing total chromatic number of 1−tree, accepted by Ars Combinatoria Wang Z, Wang L, Wang J, Lu X, Zhang Z (2004) On adjacent vertex-distinguishing total coloring of θ−graph. J Lanzhou Jiaotong Univ (...