摘要: 图
G的一个用了颜色1,2,---
t 的边着色称为区间,
t-着色，如果所有t种颜色都被用到，并且关联于
G的同一个顶点的边上的颜色是各不相同的且这些颜色构成了一个连续的整数区间。图
G称为是可区间着色的，如果对某个正整数t，
G有一个区间
t-着色。所有可区间着色的图构成的集合记作
N。对图
，使得
G有一个区间
t-着色的t的最小值和最大值分别记作
w(G)和
W(G)。本文中，我们证明了对于无穷双圈图
，有
。
Abstract:
An edge-coloring of a graph
G with colors 1,2,---
t is an interval t-coloring, if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integer. A graph
G is interval colorable if it has an interval
t-coloring for some positive integer
t. The set of all interval colorable graphs is denoted by
N . For a graph
, the least and the greatest values of
t for which
G has an interval
t-coloring are denoted by
w(G) and
W(G), respectively. In this paper, we show
for any infinite bicyclic graph
.