𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Colorings and girth of oriented planar graphs

✍ Scribed by Jarik Nešetřil; André Raspaud; Eric Sopena

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
842 KB
Volume
165-166
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

3-List-Coloring Planar Graphs of Girth 5
3-List-Coloring Planar Graphs of Girth 5
✍ C. Thomassen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 269 KB

We prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to precolor any 5-cycle in the graph. This extension implies Grötzsch's theorem that every planar graph of girth at least 4 is 3-colorable. If 1995 Academic Press, Inc.

On universal graphs for planar oriented
On universal graphs for planar oriented graphs of a given girth
✍ O.V. Borodin; A.V. Kostochka; J. Nešetřil; A. Raspaud; E. Sopena 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 662 KB

The oriented chromatic number o(H) of an oriented graph H is defined to be the minimum order of an oriented graph H' such that H has a homomorphism to H'. If each graph in a class ~ has a homomorphism to the same H', then H' is ~-universal. Let ~k denote the class of orientations of planar graphs wi

(2 + ?)-Coloring of planar graphs with l
(2 + ?)-Coloring of planar graphs with large odd-girth
✍ Klostermeyer, William; Zhang, Cun Quan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 3 views

The odd-girth of a graph is the length of a shortest odd circuit. A conjecture by Pavol Hell about circular coloring is solved in this article by showing that there is a function f ( ) for each : 0 < < 1 such that, if the odd-girth of a planar graph G is at least f ( ), then G is (2 + )-colorable. N

Oriented list colorings of graphs
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