Chromatic Number
289
浏览
0
关注

In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph (mathematics)|graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent Vertex (graph theory)|vertices share the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges share the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary have the same color. Vertex coloring is the starting point of the subject, and other coloring problems can be transformed into a vertex version. For example, an edge coloring of a graph is just a vertex coloring of its line graph, and a face coloring of a plane graph is just a vertex coloring of its dual graph|dual. However, non-vertex coloring problems are often stated and studied...
[展开]
相关概念
Lower Bound    
Planar Graph    
Random Graph    
主要的会议/期刊
演化趋势
Chart will load here
Chromatic Number文章数量变化趋势

Feedback
Feedback
Feedback
我想反馈:
排行榜