论文信息 - On chromatic uniqueness of two infinite families of graphs

On chromatic uniqueness of two infinite families of graphs

In this paper, it is proven that for each k ≥ 2, m ≥ 2, the graph Θk(m,…,m), which consists of k disjoint paths of length m with same ends is chromatically unique, and that for each m, n, 2 ≤ m ≤ n, the complete bipartite graph Km,n is chromatically unique. © 1993 John Wiley & Sons, Inc.

Feng Ming Dong | F. Dong

[1] Chong-Yun Chao,et al. On chromatic equivalence of graphs , 1978 .

[2] R. Read. An introduction to chromatic polynomials , 1968 .

[3] Chung-Piaw Teo,et al. The chromaticity of complete bipartite graphs with at most one edge deleted , 1990, J. Graph Theory.

[4] Ruth A. Bari,et al. Chromatic polynomials and whitney's broken circuits , 1977, J. Graph Theory.

[5] Lian-Chang Zhao,et al. Cutpoints and the chromatic polynomial , 1984, J. Graph Theory.

[6] Beatrice Loerinc. Chromatic uniqueness of the generalized θ-graph , 1978, Discret. Math..

[7] H. Whitney. A logical expansion in mathematics , 1932 .