✦ LIBER ✦

Homomorphisms and oriented colorings of equivalence classes of oriented graphs

✍ Scribed by William F. Klostermeyer; Gary MacGillivray

Book ID: 108315882
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 230 KB
Volume: 274
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00086-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Oriented list colorings of graphs

✍ Zs. Tuza; M. Voigt 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB 👁 1 views

A 2-assignment on a graph G (V,E) is a collection of pairs Lv of allowed colors speci®ed for all vertices v PV. The graph G (with at least one edge) is said to have oriented choice number 2 if it admits an orientation which satis®es the following property: For every 2-assignment there exists a choic

Colorings and girth of oriented planar g

Colorings and girth of oriented planar graphs

✍ Jarik Nešetřil; André Raspaud; Eric Sopena 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Oriented colorings of triangle-free plan

Oriented colorings of triangle-free planar graphs

✍ Pascal Ochem 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Homomorphisms of graphs and of their ori

Homomorphisms of graphs and of their orientations

✍ P. Hell; J. Nešetřil 📂 Article 📅 1978 🏛 Springer Vienna 🌐 English ⚖ 556 KB

Colorings and orientations of graphs

✍ N. Alon; M. Tarsi 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 575 KB

Good and semi-strong colorings of orient

Good and semi-strong colorings of oriented planar graphs

✍ André Raspaud; Eric Sopena 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 357 KB