✦ LIBER ✦

The chromaticity of certain graphs with five triangles

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

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 397 KB
Volume: 122
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90312-h

No coin nor oath required. For personal study only.

✦ Synopsis

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 particular, we prove that W(n,6) is chromatically unique for all integers n>X. We also obtain two additional families of chromatically unique graphs.

📜 SIMILAR VOLUMES

A triangle-free circle graph with chroma

A triangle-free circle graph with chromatic number 5

✍ A.A. Ageev 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 170 KB

It follows from the results of , Gyirfis and Lehel (1985), and Kostochka (1988) that 4 ~x\* ## ~5 where x\* = max {X(G): G is a triangle-free circle graph}. We show that X\* ? 5 and thus X\* = 5. This disproves the conjecture of Karapetyan that X\* = 4 and answers negatively a question of Gyirfis

Triangles in a complete chromatic graph

Triangles in a complete chromatic graph with three colors

✍ A.W Goodman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 556 KB

Let Kr~ be the complete graph on N vertices, and assume that each edge is assigned precisly one of three possible colors. An old and difficult problem is to find the minimum number of monochromatic triangles as a function of N. We are not able to solve this problem, but we can give sharp bounds for

Isomorphism of two infinite-chromatic tr

Isomorphism of two infinite-chromatic triangle-free graphs

✍ Zsolt Tuza 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 125 KB

On the chromatic number of certain highl

On the chromatic number of certain highly symmetric graphs

✍ P.P Pálfy 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 470 KB

The chromaticity of s-bridge graphs and

The chromaticity of s-bridge graphs and related graphs

✍ Shaoji Xu; Jinjie Liu; Yeehock Peng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 516 KB

Characterization of a class of triangle-

Characterization of a class of triangle-free graphs with a certain adjacency property

✍ Brian Alspach; C. C. Chen; Katherine Heinrich 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 597 KB

## Abstract Let __m__ and __n__ be nonnegative integers. Denote by __P__(__m,n__) the set of all triangle‐free graphs __G__ such that for any independent __m__‐subset __M__ and any __n__‐subset __N__ of __V__(__G__) with __M__ ∩ __N__ = Ø, there exists a unique vertex of __G__ that is adjacent to e