✦ LIBER ✦

Chromatic uniqueness in a family of 2-connected graphs

✍ Scribed by Halina Bielak

Book ID: 108316048
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 375 KB
Volume: 164
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00039-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Another family of chromatically unique g

Another family of chromatically unique graphs

✍ Yee-Hock Peng 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 368 KB

Some families of chromatically unique bi

Some families of chromatically unique bipartite graphs

✍ Xiebin Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 287 KB

Maximum chromatic polynomials of 2-conne

Maximum chromatic polynomials of 2-connected graphs

✍ Ioan Tomescu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 345 KB 👁 1 views

## Abstract In this paper we obtain chromatic polynomials __P(G__; λ) of 2‐connected graphs of order __n__ that are maximum for positive integer‐valued arguments λ ≧ 3. The extremal graphs are cycles __C__~__n__~ and these graphs are unique for every λ ≧ 3 and __n__ ≠ 5. We also determine max{__P(

A note on chromatic uniqueness of graphs

✍ G. L. Chia 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

On chromatic uniqueness of two infinite

On chromatic uniqueness of two infinite families of graphs

✍ Feng-Ming Dong 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB 👁 1 views

## Abstract In this paper, it is proven that for each __k__ ≥ 2, __m__ ≥ 2, the graph Θ~__k__~(__m,…,m__), which consists of __k__ disjoint paths of length __m__ with same ends is chromatically unique, and that for each __m, n__, 2 ≤ __m__ ≤ __n__, the complete bipartite graph __K__~__m,n__~ is chr

Chromatic classes of certain 2-connected

Chromatic classes of certain 2-connected (n, n + 2)-graphs II

✍ X.E. Chen; K.Z. Ouyang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Let S denote the class of 2-connected (n, n + 2)-graphs which have girth 5 and are not homeomorphic to K4. Chromatic classes of graphs in S are determined in this paper.