✦ LIBER ✦

b-coloring of tight bipartite graphs and the Erdős–Faber–Lovász conjecture

✍ Scribed by Lin, Wu-Hsiung; Chang, Gerard J.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A coloring problem related to the Erdős-

✍ Peter Horák 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 80 KB

A fractional version of the Erdős-Faber-

✍ Jeff Kahn; P. D. Seymour 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 301 KB

Edge coloring of hypergraphs and a conje

✍ W. I. Chang; E. L. Lawler 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 133 KB

A remark on the conjecture of Erdös, Fab

✍ Hauke Klein; Marian Margraf 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 67 KB