✦ LIBER ✦

A characterization of chromatically rigid polynomials

✍ Scribed by O. V. Vorodin; I. G. Dmitriev

Publisher: SP MAIK Nauka/Interperiodica
Year: 1991
Tongue: English
Weight: 486 KB
Volume: 32
Category: Article
ISSN: 0037-4466
DOI: 10.1007/bf00970154

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On σ-polynomials and a class of chromati

On σ-polynomials and a class of chromatically unique graphs

✍ Qingyan Du 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 655 KB

Du, Q., On o-polynomials and a class of chromatically unique graphs, Discrete Mathematics 115 (1993) 153-165. Let cr(G)=C:,,aicr '-' be the u-polynomial of a graph G. We ask the question: When k and a, are given, what is the largest possible value of ai(O < i < k) for any graph G? In this paper, thi

A chromatic partition polynomial

✍ Einar Steingrímsson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 618 KB

A polynomial in two variables is defned by C,(x,t)= ~-~cn,, Z( a~,x)tl~l, where Hn is the lattice of partitions of the set { I, 2 ..... n}, G~ is a certain interval graph defined in terms of the partition 7r, z(G~,x) is the chromatic polynomial of G~ and Inl is the number of blocks in n. It " t ~-~i

Classification of chromatically unique g

Classification of chromatically unique graphs having quadratic σ-polynomials

✍ Nian-Zu Li; Earl Glen Whitehead Jr.; Shao-Ji Xu 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 329 KB 👁 1 views

Frucht and Giudici classified all graphs having quadratic a-polynomials. Here w e classify all chromatically unique graphs having quadratic (Tpolynomials.

Proof of a Chromatic Polynomial Conjectu

Proof of a Chromatic Polynomial Conjecture

✍ F.M. Dong 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 138 KB

Let P(G, \*) denote the chromatic polynomial of a graph G. It is proved in this paper that for every connected graph G of order n and real number \* n, (\*&2) n&1 P(G, \*)&\*(\*&1) n&2 P(G, \*&1) 0. By this result, the following conjecture proposed by Bartels and Welsh is proved: P(G, n)(P(G, n&1))

A note concerning chromatic polynomials

✍ Chong-Yun Chao; Lian-Chang Zhao 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Maximum chromatic polynomial of 3-chroma

Maximum chromatic polynomial of 3-chromatic blocks

✍ Ioan Tomescu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 397 KB

In this paper it is proved that if the chromatic polynomial P(G; 2) is maximum for 2 = 3 in the class of 3-chromatic 2-connected graphs G of order n, then G is isomorphic to the graph consisting of C4 and Cn-l, having in common a path of length two for every even n/> 6. This solves a conjecture rais