✦ LIBER ✦

The chromatic uniqueness of W10

✍ Scribed by Nian-Zu Li; Earl Glen Whitehead Jr

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 165 KB
Volume: 104
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90334-c

No coin nor oath required. For personal study only.

✦ Synopsis

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 the wheel on ten vertices is chromatically unique by computer computations.

Here, we sketch a mathematical proof of the chromatic uniqueness of the wheel on ten vertices.

📜 SIMILAR VOLUMES

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

On the chromatic uniqueness of the graph

On the chromatic uniqueness of the graph W(n, n − 2) + Kk

✍ Feng-Ming Dong; Yanpei Liu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 360 KB

The chromatic uniqueness of certain brok

The chromatic uniqueness of certain broken wheels

✍ K.M. Koh; C.P. Teo 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Chromatic uniqueness of the generalized

Chromatic uniqueness of the generalized θ-graph

✍ Beatrice Loerinc 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 323 KB

A generalized O-graph i.~ a wnnected graph with 3 palths between a pair of vertices of degree 3. It is showi:~ that uny graph having the same ckomatic polynomial as a generaiized O-graph, must be isomorphic to tk generalized O-graph.

The chromatic uniqueness of complete bip

The chromatic uniqueness of complete bipartite graphs

✍ Shaoji Xu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 585 KB

Xu, S., The chromatic uniqueness of complete bipartite graphs, Discrete Mathematics 94 (1991) 153-159. This paper is partitioned into two parts. In the first part we determine the maximum number of induced complete bipartite subgraphs in graphs with some given conditions. Using a theorem given in th

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