𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the chromatic uniqueness of the graphW(n, n − 2, k)

✍ Scribed by F. M. Dong; Y. P. Liu

Publisher
Springer Japan
Year
1996
Tongue
English
Weight
468 KB
Volume
12
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromatic classes of certain 2-connected
Chromatic classes of certain 2-connected (n, n + 2)-graphs homeomorphic to K4
✍ X.E. Chen; K.Z. Ouyang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Chromatic classes of 2-connected (n, n + 2)-graphs which are horneomorphic to K4 and have girth 5 are given in this paper. Lemma 1. (a) If(6,~,rl)¢ Uj~3{(j,j-2,j+ 1), (j-2,j+2,j-1)} andFl (6,~,rl)~ Fl(6t, y',rlt ), then F1(6,7,~/) ~ Ft(6',7',¢).

On Integers of the Forms k−2n and k2n+1
On Integers of the Forms k−2n and k2n+1
✍ Yong-Gao Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 85 KB

In this paper we prove that the set of positive odd integers k such that k&2 n has at least three distinct prime factors for all positive integers n contains an infinite arithmetic progression. The same result corresponding to k2 n +1 is also true.

On the join of graphs and chromatic uniq
On the join of graphs and chromatic uniqueness
✍ G. L. Chia 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 519 KB

## Abstract A graph is chromatically unique if it is uniquely determined by its chromatic polynomial. Let __G__ be a chromatically unique graph and let __K__~__m__~ denote the complete graph on __m__ vertices. This paper is mainly concerned with the chromaticity of __K__~__m__~ + __G__ where + deno

A note on the chromatic uniqueness of W1
A note on the chromatic uniqueness of W10
✍ Ronald C. Read 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 88 KB

vertices, for p odd. has shown however t e of graphs on PO vertices whose construction was described in [ 11. search was na o other graph with this chromatic polynomial was found. es