A Theorem on n-Coloring the Points of a Linear Graph
A Theorem on n-Coloring the Points of a Linear Graph
复制标题
DOI：
10.1080/00029890.1962.11989938
复制
发表时间：
1962-08
影响因子：
0.5
通讯作者：
G. Minty
中科院分区：
文献类型：
--
作者：
G. Minty
定义见[1]。我们说一个(无向)线性图的点是n色的，如果它们被分成n个集(其中一些可能是空的)，使得对于图的每条边，这条边的端点在不同的集中。在有向图中，考虑一个圈(简单的闭合曲线)。我将使用循环的流量比这一术语来表示MFN的比率，其中m和n是循环的一个方向和另一个方向的边数，m；？；n。(流量比可以是+oo。)
For the definitions, see [1]. We say that the points of an (unoriented) linear graph are n-colored if they are partitioned into n sets (some of which may be empty) so that, for each edge of the graph, the end-points of this edge are in different sets. In an oriented graph, consider a cycle (simple closed curve). I shall use the term flow-ratio of the cycle to mean the ratio mfn, where m and n are the numbers of edges of the cycle directed one way and the other around the cycle and m;?; n.(The flowratio may be+ oo.)