✦ LIBER ✦

ON THE MAXIMUM NUMBER OF COLORS FOR LINKS

✍ Scribed by JABLAN, SLAVIK; KAUFFMAN, LOUIS H.; LOPES, PEDRO

Book ID: 120219209
Publisher: World Scientific Publishing Company
Year: 2013
Tongue: English
Weight: 461 KB
Volume: 22
Category: Article
ISSN: 0218-2165
DOI: 10.1142/S0218216513500132

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum number of colors: C-coloring and

Maximum number of colors: C-coloring and related problems

✍ Csilla Bujtás; Zsolt Tuza 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 220 KB

On the number of discernible colors

✍ C. S. McCamy 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 40 KB 👁 2 views

## On the Number of Discernible On the Number of Discernible Colors Colours I was surprised that, in their study of the number of dis-The authors are grateful to Cal McCamy for his timely cernible colors, Pointer and Attridge 1 missed the early response to their original article. Neither they, nor

Maximum number of colorings of (2k, k2)-

Maximum number of colorings of (2k, k2)-graphs

✍ Felix Lazebnik; Oleg Pikhurko; Andrew Woldar 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 1 views

## Abstract Let ${\cal F}\_{{2}{k},{k}^{2}}$ consist of all simple graphs on 2__k__ vertices and ${k}^{2}$ edges. For a simple graph __G__ and a positive integer $\lambda$, let ${P}\_{G}(\lambda)$ denote the number of proper vertex colorings of __G__ in at most $\lambda$ colors, and let $f(2k, k^{2

Some new bounds for the maximum number o

Some new bounds for the maximum number of vertex colorings of a (v,e)-graph

✍ Byer, Owen D. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 3 views

Let f (v, e, λ) denote the maximum number of proper vertex colorings of a graph with v vertices and e edges in λ colors. In this paper we present some new upper bounds for f (v, e, λ). In particular, a new notion of pseudoproper colorings of a graph is given, which allows us to significantly improve

On the Discrete Maximum Principle for th

On the Discrete Maximum Principle for the Beltrami Color Flow

✍ Lorina Dascal; Adi Ditkowski; Nir A. Sochen 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 675 KB

On the number of list-colorings

✍ Quentin Donner 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract Given a __list of boxes L__ for a graph __G__ (each vertex is assigned a finite set of colors that we call a box), we denote by __f__(__G, L__) the number of L‐__colorings__ of __G__ (each vertex must be colored wiht a color of its box). In the case where all the boxes are identical and