𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing clique and chromatic number of circular-perfect graphs in polynomial time

✍ Scribed by Pêcher, Arnaud; Wagler, Annegret K.

Book ID
121625640
Publisher
Springer-Verlag
Year
2012
Tongue
English
Weight
196 KB
Volume
141
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Estimates of coefficients of chromatic p
Estimates of coefficients of chromatic polynomials and numbers of cliques of (c,n,m)-graphs
✍ Philippe Pitteloud 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract This paper is mainly concerned with classes of simple graphs with exactly __c__ connected components, __n__ vertices and __m__ edges, for fixed __c,n,m__ ∈ ℕ. We find an optimal lower bound for the __i__th coefficient of the chromatic polynomial of a graph in such a class and also an op