𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Good and nice colorings of balanced hypergraphs

✍ Scribed by D. de Werra

Book ID
108113630
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
189 KB
Volume
306
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On balanced colorings of hypergraphs
On balanced colorings of hypergraphs
✍ A. P. Rozovskaya; M. V. Titova; D. A. Shabanov 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 205 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

Split and balanced colorings of complete
Split and balanced colorings of complete graphs
✍ Paul Erdös; András Gyárfás 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 429 KB

An (r, n)-split coloring of a complete graph is an edge coloring with r colors under which the vertex set is partitionable into r parts so that for each i, part i does not contain K, in color i. This generalizes the notion of split graphs which correspond to (2, 2)-split colorings. The smallest N fo

Multiply balanced edge colorings of mult
Multiply balanced edge colorings of multigraphs
✍ M. A. Bahmanian; C. A. Rodger 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB

## Abstract In this article, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge‐colored amalgamated graph so that the result is a graph in which the edges are shared out among the vertices in ways that are fair wit