Colorings and orientations of graphs
โ Scribed by N. Alon; M. Tarsi
- Publisher
- Springer-Verlag
- Year
- 1992
- Tongue
- English
- Weight
- 575 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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 รฟ
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
Given a finite set T of positive integers containing {0}, a T-coloring of a simple graph G is a nonnegative integer function f defined on the vertex set of G, such that if (u, v} E E(G) then Lf(u) -f (u)l $ T. The T-span of a T-coloring is defined as the difference of the largest and smallest colors