✦ LIBER ✦

Necessary condition for a chromatic polynomial

✍ Scribed by B. D. Kotlyar

Book ID: 110611586
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 207 KB
Volume: 34
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf02667053

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Necessary conditions for Hadamard factor

Necessary conditions for Hadamard factorizations of Hurwitz polynomials

✍ Carlos Arturo Loredo-Villalobos; Baltazar Aguirre-Hernández 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 303 KB

Necessary conditions for Schur-stability

Necessary conditions for Schur-stability of interval polynomials

✍ Greiner, R. 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 206 KB

Approximations for chromatic polynomials

✍ N.L Biggs; G.H.J Meredith 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 671 KB

Necessary conditions for reversed Dickso

Necessary conditions for reversed Dickson polynomials to be permutational

✍ Xiang-dong Hou; Tue Ly 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 187 KB

A Matrix Method for Chromatic Polynomial

A Matrix Method for Chromatic Polynomials

✍ Norman Biggs 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 111 KB

The chromatic polynomials of certain families of graphs can be expressed in terms of the eigenspaces of a linear operator. The operator is represented by a matrix, which is referred to here as the compatibility matrix. In this paper complete sets of eigenfunctions are obtained for several related fa