✦ LIBER ✦

On proper colorings of hypergraphs

✍ Scribed by N. V. Gravin, D. V. Karpov

Book ID: 113072926
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 285 KB
Volume: 184
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-012-0884-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On two-colorings of hypergraphs

✍ D. D. Cherkashin; A. B. Kulikov 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 191 KB

On balanced colorings of hypergraphs

✍ A. P. Rozovskaya; M. V. Titova; D. A. Shabanov 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 205 KB

On general two-colorings of uniform hype

On general two-colorings of uniform hypergraphs

✍ A. P. Rozovskaya 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 152 KB

On splittable colorings of graphs and hy

On splittable colorings of graphs and hypergraphs

✍ Zoltán Füredi; Radhika Ramamurthi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

## Abstract The notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two‐round game played against an

H-colorings of dense hypergraphs

✍ Edyta Szymańska 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Trees in greedy colorings of hypergraphs

✍ András Gyárfás; Jenő Lehel 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 167 KB