𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Antisymmetric flows and edge-connectivity

✍ Scribed by Matt DeVos; Jaroslav Nešetřil; André Raspaud

Book ID
104113355
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
205 KB
Volume
276
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 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

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 ÿ