✦ LIBER ✦

The chromatic spectrum of 3-uniform bi-hypergraphs

✍ Scribed by Ping Zhao; Kefeng Diao; Kaishun Wang

Book ID: 113567411
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 222 KB
Volume: 311
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.08.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimum chromatic spectrum of 3-unif

The minimum chromatic spectrum of 3-uniform\(\mathcal{C}\)-hypergraphs

✍ Zhang, Ruixue; Zhao, Ping; Diao, Kefeng; Lu, Fuliang 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 151 KB

The Chromatic Spectrum of Mixed Hypergra

The Chromatic Spectrum of Mixed Hypergraphs

✍ Tao Jiang; Dhruv Mubayi; Zsolt Tuza; Vitaly Voloshin; Douglas B. West 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 131 KB

Chromatic Coefficients of Linear Uniform

Chromatic Coefficients of Linear Uniform Hypergraphs

✍ Ioan Tomescu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Some Properties of Chromatic Coefficient

Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs

✍ Ioan Tomescu; Syed Ahtsham ul Haq Bokhary 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 214 KB

On the Degree, Size, and Chromatic Index

On the Degree, Size, and Chromatic Index of a Uniform Hypergraph

✍ Noga Alon; Jeong Han Kim 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 274 KB

Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the maximum degree of a vertex of H. We conjecture that for every =>0, if D is sufficiently large as a function of t, k, and =, then the chromatic index of H is at most (t&1+1Ât+=) D. We prove t

Spanning trees of 3-uniform hypergraphs

✍ Andrew Goodall; Anna de Mier 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 436 KB