𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Antisymmetric flows and strong oriented coloring of planar graphs

✍ Scribed by Robert S̆ámal

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
190 KB
Volume
273
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 ÿnd a small antisymmetric ow for any planar graph. In the proof we use a result from combinatorial number theory-the existence of large Sidon sets.

📜 SIMILAR VOLUMES

Antisymmetric flows on planar graphs
Antisymmetric flows on planar graphs
✍ T. H. Marshall 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

## Abstract We prove that every oriented planar graph admits a homomorphism to the Paley tournament __P__~271~ and hence that every oriented planar graph has an antisymmetric flow number and a strong oriented chromatic number of at most 271. © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 200–210

Adapted list coloring of planar graphs
Adapted list coloring of planar graphs
✍ Louis Esperet; Mickaël Montassier; Xuding Zhu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 1 views

## Abstract Given an edge coloring __F__ of a graph __G__, a vertex coloring of __G__ is __adapted to F__ if no color appears at the same time on an edge and on its two endpoints. If for some integer __k__, a graph __G__ is such that given any list assignment __L__ to the vertices of __G__, with |_

Acyclic list 7-coloring of planar graphs
Acyclic list 7-coloring of planar graphs
✍ O. V. Borodin; D. G. Fon-Der Flaass; A. V. Kostochka; A. Raspaud; E. Sopena 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

## Abstract The acyclic list chromatic number of every planar graph is proved to be at most 7. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 83–90, 2002

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