𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Good and semi-strong colorings of oriented planar graphs

✍ Scribed by André Raspaud; Eric Sopena

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
357 KB
Volume
51
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Antisymmetric flows and strong oriented
Antisymmetric flows and strong oriented coloring of planar graphs
✍ Robert S̆ámal 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 190 KB

NeÄ setÄ ril and Raspaud (Ann. Inst. Fourier 49 (3) (1999) 1037-1056) deÿned antisymmetric ow, which is a variant of nowhere zero ow, and a dual notion to strong oriented coloring. We give an upper bound on the number of colors needed for a strong oriented coloring of a planar graph, and hereby we ÿ

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

Incidence and strong edge colorings of g
Incidence and strong edge colorings of graphs
✍ Richard A. Brualdi; Jennifer J. Quinn Massey 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 485 KB

We define the incidence coloring number of a graph and bound it in terms of the maximum degree. The incidence coloring number turns out to be the strong chromatic index of an associated bipartite graph. We improve a bound for the strong chromatic index of bipartite graphs all of whose cycle lengths

Extending colorings of locally planar gr
Extending colorings of locally planar graphs
✍ Michael O. Albertson; Joan P. Hutchinson 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB 👁 1 views

Suppose G is a graph embedded in S g with width (also known as edge width) at least 264(2 g À 1). If P V(G) is such that the distance between any two vertices in P is at least 16, then any 5-coloring of P extends to a 5-coloring of all of G. We present similar extension theorems for 6-and 7-chromati

Total colorings of planar graphs with la
Total colorings of planar graphs with large maximum degree
✍ Borodin, O. V.; Kostochka, A. V.; Woodall, D. R. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 3 views

It is proved that a planar graph with maximum degree ∆ ≥ 11 has total (vertex-edge) chromatic number ∆ + 1.