Li, N.-Z. and E.G. Whitehead Jr, The chromatic uniqueness of W,,, Discrete Mathematics 104 (1992) 197-199. Xu and Li proved the chromatic uniqueness of wheels on an odd number of vertices. It is known that the wheels on six vertices and eight vertices are not chromatically unique. Read found that th
A note on the chromatic uniqueness of W10
โ Scribed by Ronald C. Read
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 88 KB
- Volume
- 69
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
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
๐ SIMILAR VOLUMES
## 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
## Abstract A. Vince introduced a natural generalization of graph coloring and proved some basic facts, revealing it to be a concept of interest. His work relies on continuous methods. In this note we make some simple observations that lead to a purely combinatorial treatment. Our methods yield sho
In Bandelt and Dress Adยจ. in Math. 92 1992 , 47แ105 the concept of a coherent decomposition of a finite metric is introduced and it is conjectured that every such metric can be decomposed into a coherent sum of prime metrics in a unique way. In this note we give a counterexample to this conjecture.