✦ LIBER ✦

Dynamic proper colorings of a graph

✍ Scribed by D. V. Karpov

Book ID: 106436600
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 353 KB
Volume: 179
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-011-0612-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New upper bounds for the greatest number

New upper bounds for the greatest number of proper colorings of a (V,E)-graph

✍ Felix Lazebnik 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

## Abstract Let 𝒻 denote the family of simple undirected graphs on __v__ vertices having __e__ edges ((__v__, __e__)‐graphs) and __P__(__G__; λ) be the chromatic polynomial of a graph __G.__ For the given integers __v__, __e__, and λ, let __f__(__v__, __e__, λ) denote the greatest number of proper

On proper colorings of hypergraphs

✍ N. V. Gravin, D. V. Karpov 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 285 KB

Even edge colorings of a graph

✍ B. Devadas Acharya 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 78 KB

Even edge colorings of a graph

✍ Noga Alon; Yoshimi Egawa 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 59 KB

Near-proper vertex 2-colorings of sparse

Near-proper vertex 2-colorings of sparse graphs

✍ O. V. Borodin; A. O. Ivanova 📂 Article 📅 2010 🏛 Pleiades Publishing 🌐 English ⚖ 420 KB

A Note on Graph Colorings and Graph Poly

A Note on Graph Colorings and Graph Polynomials

✍ Noga Alon; Michael Tarsi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 230 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using