๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Colorings and girth of oriented planar g
โœ Jarik Neลกetล™il; Andrรฉ Raspaud; Eric Sopena ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 842 KB
Antisymmetric flows and strong oriented
โœ 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
โœ 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

T-colorings of graphs
โœ Daphne Der-Fen Liu ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 594 KB

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

Iterated colorings of graphs
โœ Sandra M Hedetniemi; Stephen T Hedetniemi; Alice A McRae; Dee Parks; Jan Arne Te ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 786 KB