𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs

✍ Scribed by Pascal Ochem, Alexandre Pinlou

Book ID
120788822
Publisher
Springer Japan
Year
2013
Tongue
English
Weight
422 KB
Volume
30
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Acyclic edge coloring of triangle-free p
Acyclic edge coloring of triangle-free planar graphs
✍ Manu Basavaraju; L. Sunil Chandran πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 233 KB πŸ‘ 2 views

An __acyclic__ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The __acyclic chromatic index__ of a graph is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__β€²(__G__). It was conjectured by Al

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 ΓΏ