𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Series–parallel chromatic hypergraphs

✍ Scribed by Ioan Tomescu; Syed Ahtsham Ul Haq Bokhary

Book ID
108112841
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
482 KB
Volume
158
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On -chromatic hypergraphs
On -chromatic hypergraphs
✍ Dmitry A. Shabanov 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 316 KB
Chromatic polynomials of hypergraphs
Chromatic polynomials of hypergraphs
✍ Ewa Drgas-Burchardt; Ewa Łazuka 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 182 KB

We consider a natural generalization of the chromatic polynomial of a graph. Let the symbol f (x 1 ,...,x m ) (H, λ) denote a number of different λ-colourings of a hypergraph H = (X, E), where X = {v 1 , . . . , v n } and E = {e 1 , . . . , e m }, satisfying that in an edge e i there are used at lea

Chromaticity of series-parallel graphs
Chromaticity of series-parallel graphs
✍ K.M. Koh; C.P. Teo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 454 KB

By applying a sequence of edge-gluings on a set of cycles each of length k, we obtain a special series-parallel graph. The well-known k-gon tree theorem (see [l, lo]) states that these graphs form a X-equivalence class. Many of the other known classes of X-unique graphs and X-equivalence classes are

On chromaticity of hypergraphs
On chromaticity of hypergraphs
✍ Mieczysław Borowiecki; Ewa Łazuka 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 181 KB