查询词典 graph coloring

In this dissertation, we shall study the incidence coloring ofθ- graph, then we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs and determine the adjacent vertex distinguishing incidence chromatic number of some graphs.

本文研究了θ-图的关联着色，定义了图的邻点可区别关联着色及邻点可区别关联色数并确定了几类图的邻点可区别关联色数。

The course contains four sections as follows: mathematical logic (including basic concepts of propositional logic and predicate logic, propositional calculuses and inference theories), set theory (including set algebras, relations, functions and cardinal numbers), algebraic structure (including algebraic systems, semigroups and groups, rings and fields, lattices and Boolean algebras), graph theory (including basic concepts of graph, Euler graphs and Hamiltonian graphs, trees, planar graphs and coloring graphs, some special vertex subsets and edge subsets).

本课程包含四部分内容：数理逻辑（包含命题逻辑与一阶逻辑的基本概念、等值演算以及推理理论），集合论（包含集合代数、二元关系、函数和基数），代数结构（包含代数系统、半群与群、环与域、格与布尔代数），图论（包含图的基本概念、欧拉图与哈密顿图、树、平面图及图的着色、图的某些特殊的顶点子集与边子集）。

The graph vertex coloring problem is the main topic of graph theory and applied in many fields, which is known as NP-complete problem.

图顶点着色问题存在于丰富的科学和工程应用中，如工序问题、排课表问题、物资储存问题等等，但它却是众所周知的NP-完全问题。

As the general interval coloring problem is NP-complete, a property of the program, namely the containment of arrays\' live-ranges, is used to decrease the hardness of interval coloring and simplify it as an interval coloring problem for superperfect graph. Based on this, a judgment theorem for optimal interval coloring together with the implementation algorithm is proposed.

由于一般的区间着色问题是NP完全问题，我们利用程序所具有的一个性质，即数组生命周期的包含性来降低区间着色的难度，将一般的区间着色问题简化为超完美图的区间着色问题，并据此提出了实现最优区间着色的判定条件以及实现算法。

In section four,we will study the star-edge coloring of maximal outer plane graph and maximal plane graph,and bound their star chromatic index.

第四节研究了极大外平面图和极大平面图的星边染色，并界定了它们的星边色数。

The main research works in this article are as follows:(1) Studying and analysising special algorithms (such as Genetic Algorithms, Neuual Networks and Simulated Annealing Algorithms) based on the proper K-vertex coloring, and applied to the strong vertex-distinguishing total coloring on complete graph on complete graph, then analysises a series of questions as well as the consequences after the application .

本文的主要研究工作如下：(1)分析了基于经典算法(遗传算法、神经网络、模拟退火算法)的正常K-点染色，并把它们应用到完全图的点可区别强全染色中，分析了应用之后出现的一系列问题以及造成的后果，结果表明这些算法是不适合应用在完全图的点可区别强全染色中的。

In 2004 Zhang Zhongfu presented the concept ofadjacent vertex distinguishing total coloring whose content is: Let G be a connectedsimple graph with order at least 2, k be a positive integer and f be a mappling fromV∪E to {1,2,...,k}. Let C={f}∪{f|uv∈E,v∈V}for all u∈V. If (1) for any uv, vw∈E,u≠w, we have f≠f;(2) for any uv∈E, we have f≠f, f≠f, f≠f,then f is called a k-proper total coloring of graph G.

第三章和第四章主要研究了两种联图的邻点可区别全染色，邻点可区别全染色的定义是张忠辅在2004年提出来的，其内容为：设G是阶至少为2的简单连通图，k是正整数，f是V∪E到{1，2，…，k}的映射，对任意u∈V，记C={f}∪{f|uv∈E，v∈V}。

We apply the results in Chapter 2 to the equitable list coloring of graphs and prove that a graph G is equitably △-choosable if G is a plane graph without i-cycles, 3 ≤ i ≤ 5, or a plane graph without 4-cycles(or 5-cycles) and 6-cycles.

从而得出不含3-圈，4-圈和5-圈的平面图和不含4-圈(或5-圈)和6-圈的平面图GΔ(G≥6均有一个Δ-均匀列表染色。

The thesis put forward a arrangement algorithm of examinatorial course based on sequential coloring algorithm which using the knowledge of array and structural linked list in C++ language ,combining the sequential coloring algorithm in graph theory to solve the conflict in arranging the examination course.

论文运用C++语言中的数组和链表结构的相关知识，结合《图论及其算法》中的顺序着色算法，提出了一种基于顺序着色算法的考试课程安排算法。

In 2006,LIU Xin-sheng et al.introduced the concept of star-edge coloring of graphs, a star-edge coloring of graph G is a proper edge coloring of G such that any path of length 4 in G is not bicolored.The star chromatic index of G,denoted byχ_s,is the smallest integer k for which G admits a star-edge coloring with k colors.

2006年，刘信生等提出了星边染色的概念，若图G的一个正常边染色满足G中没有长为4的路是2-边染色的，则称此染色是G的一个星边染色，使得G有星边染色的最小颜色数称为星边色数，记作χ_s。

On the other hand, the more important thing is because the urban housing is a kind of heterogeneity products.

另一方面，更重要的是由于城市住房是一种异质性产品。

Climate histogram is the fall that collects place measure calm value, cent serves as cross axle for a few equal interval, the area that the frequency that the value appears according to place is accumulated and becomes will be determined inside each interval, discharge the graph that rise with post, also be called histogram.

气候直方图是将所收集的降水量测定值，分为几个相等的区间作为横轴，并将各区间内所测定值依所出现的次数累积而成的面积，用柱子排起来的图形，也叫做柱状图。