✦ LIBER ✦

The chromaticity of wheels with a missing spoke

✍ Scribed by G.L. Chia

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 268 KB
Volume: 82
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90326-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The chromaticity of wheels with a missin

The chromaticity of wheels with a missing spoke II

✍ G.L. Chia 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 309 KB

In the previous paper, it was shown that the graph U. ÷ 1 obtained from the wheel W n ÷ 1 by deleting a spoke is uniquely determined by its chromatic polynomial if n >i 3 is odd. In this paper, we show that the result is also true for even n >~ 4 except when n = 6 in which case, the graph W given in

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 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

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

Circular Chromatic Numbers of Distance G

Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples

✍ Lingling Huang; Gerard J Chang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 114 KB

Given positive integers m, k, s with m > sk, let D m,k,s represent the set {1, 2, . . . , m}\{k, 2k, . . . , sk}. The distance graph G(Z , D m,k,s ) has as vertex set all integers Z and edges connecting i and j whenever |i -j| ∈ D m,k,s . This paper investigates chromatic numbers and circular chroma

The chromaticity of certain graphs with

The chromaticity of certain graphs with five triangles

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

Let W(n, k) denote the graph of order n obtained from the wheel I+', by deleting all but k consecutive spokes. In this note, we study the chromaticity of graphs which share certain properties of U'(n, 6) which can be obtained from the coeffictents of the chromatic polynomial of W(n, 6). In particula