✦ LIBER ✦

On the Sperner lemma and some colorings of graphs

✍ Scribed by André Bouchet

Book ID: 107884014
Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 328 KB
Volume: 14
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90060-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On some properties of suboptimal colorin

On some properties of suboptimal colorings of graphs

✍ Ivo Blöchliger; D. de Werra 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

On the colorings of outerplanar graphs

✍ Weifan Wang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB

The Johnson-Lindenstrauss lemma and the

The Johnson-Lindenstrauss lemma and the sphericity of some graphs

✍ P Frankl; H Maehara 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 305 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

f-Colorings of some graphs off-class 1

✍ Xia Zhang; Gui Zhen Liu 📂 Article 📅 2008 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 174 KB

On 3-colorings of Plane Graphs

✍ Bao-gang Xu 📂 Article 📅 2004 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 162 KB