𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum Number of Palettes in Edge Colorings

✍ Scribed by Mirko Horňák, Rafał Kalinowski, Mariusz Meszka, Mariusz Woźniak

Book ID
120788836
Publisher
Springer Japan
Year
2013
Tongue
English
Weight
319 KB
Volume
30
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 3-Edge Colorings of Cub
On the Number of 3-Edge Colorings of Cubic Graphs
✍ Christian Szegedy 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In this paper we present a short algebraic proof for a generalization of a formula of R. Penrose, Some applications of negative dimensional tensors, in: Combinatorial Mathematics and its Applications Welsh (ed.), Academic Press, 1971, pp. 221-244 on the number of 3-edge colorings of a plane cubic gr

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