✦ LIBER ✦

Fractional Path Coloring in Bounded Degree Trees with

✍ Scribed by I. Caragiannis; A. Ferreira; C. Kaklamanis; S. Pérennes; H. Rivano

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sum Coloring of Bipartite Graphs with Bo

✍ Michal Malafiejski; Krzysztof Giaro; Robert Janczewski; Marek Kubale 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 580 KB

Resource Allocation in Bounded Degree Tr

✍ Reuven Bar-Yehuda; Michael Beder; Yuval Cohen; Dror Rawitz 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 452 KB

Spanning trees with bounded degrees

✍ Victor Neumann-Lara; Eduardo Rivera-Campo 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 276 KB

Maximal Trees with Bounded Maximum Degre

✍ Noga Alon; Mario Szegedy 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 123 KB

Mixed hypergraphs with bounded degree: e

✍ Daniel Král’; Jan Kratochvı&#x0301;l; Heinz-Jürgen Voss 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 163 KB

Optimal parallel algorithms for coloring

✍ G. Sajith; Sanjeev Saxena 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 474 KB