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

On-Line Edge-Coloring with a Fixed Number of Colors

โœ Scribed by Lene Monrad Favrholdt and Morten Nyhave Nielsen

Book ID
120136569
Publisher
Springer
Year
2003
Tongue
English
Weight
134 KB
Volume
35
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Interval edge coloring of a graph with f
Interval edge coloring of a graph with forbidden colors
โœ Marek Kubale ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 596 KB

## This paper is complementary to Kubale (1989). We consider herein a problem of interval coloring the edges of a graph under the restriction that certain colors cannot be used for some edges. We give lower and upper bounds on the minimum number of colors required for such a coloring. Since the ge

The number of edge colorings with no mon
The number of edge colorings with no monochromatic triangle
โœ Yuster, Raphael ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 639 KB

Let F(n, k) denote the maximum number of t w o edge colorings of a graph on n vertices that admit no monochromatic Kk. la complete graph on k vertices). The following results are proved: f ( n , 3) = 2Ln2/41 for all n 2 6. f ( n , k) = 2((k~2)/(2k-2)+o( 1))n'. In particular, the first result solves

On the number of colorings of a snark mi
On the number of colorings of a snark minus an edge
โœ Richard C. Bradley ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB

For a given snark G and a given edge e of G, let (G; e) denote the nonnegative integer such that for a cubic graph conformal to G ร€ feg, the number of Tait colorings with three given colors is 18 ร (G; e). If two snarks G 1 and G 2 are combined in certain well-known simple ways to form a snark G, th