𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Gallai's Theorem for List Coloring of Digraphs

✍ Scribed by Harutyunyan, Ararat; Mohar, Bojan

Book ID
118197144
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
264 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On greene's theorem for digraphs
On greene's theorem for digraphs
✍ Irith Ben-Arroyo Hartman; Fathi Saleh; Daniel Hershkowitz 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

## Abstract Greene's Theorem states that the maximum cardinality of an optimal __k__‐path in a poset is equal to the minimum __k__‐norm of a __k__‐optimal coloring. This result was extended to all acyclic digraphs, and is conjectured to hold for general digraphs. We prove the result for general dig