✦ LIBER ✦

Some Properties of Chromatic Coefficients of Linear Uniform Hypergraphs

✍ Scribed by Ioan Tomescu; Syed Ahtsham ul Haq Bokhary

Book ID: 106047798
Publisher: Springer Japan
Year: 2009
Tongue: English
Weight: 214 KB
Volume: 25
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-009-0856-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromatic Coefficients of Linear Uniform

Chromatic Coefficients of Linear Uniform Hypergraphs

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

The chromatic spectrum of 3-uniform bi-h

The chromatic spectrum of 3-uniform bi-hypergraphs

✍ Ping Zhao; Kefeng Diao; Kaishun Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 222 KB

On the Chromaticity of Quasi Linear Hype

On the Chromaticity of Quasi Linear Hypergraphs

✍ Ioan Tomescu, Sana Javed 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 152 KB

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

On line graphs of linear 3-uniform hyper

On line graphs of linear 3-uniform hypergraphs

✍ Metelsky, Yury; Tyshkevich, Regina 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

It is known that the class of line graphs of linear 3-uniform hypergraphs cannot be characterized by a finite list of forbidden induced subgraphs (R. N.

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