✦ LIBER ✦

The chromatic uniqueness of certain broken wheels

✍ Scribed by K.M. Koh; C.P. Teo

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 178 KB
Volume: 96
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90471-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The chromaticity of wheels

✍ Shao-Ji Xu; Nian-Zu Li 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 746 KB

In this paper we prove that the wheel W,, show tha\*: W, is not chromatically unique. +1 is chromatically unique ifnis even. We also Two graphs G and H are said to be chromatically equivalent 2 they ha?re the same chromlatic polynomial, i.e. ## , P(G, A)==P(H, A). A graph G is said to be chromatic

The chromatic uniqueness of W10

✍ Nian-Zu Li; Earl Glen Whitehead Jr 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 165 KB

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

The chromatic Ramsey number of odd wheel

The chromatic Ramsey number of odd wheels

✍ Nathalie Paul; Claude Tardif 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

We prove that the chromatic Ramsey number of every odd wheel W 2k+1 , k ≥ 2 is 14. That is, for every odd wheel W 2k+1 , there exists a 14-chromatic graph F such that when the edges of F are two-coloured, there is a monochromatic copy of W 2k+1 in F, and no graph F with chromatic number 13 has the s

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