𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new upper bound for the list chromatic number

✍ Scribed by B. Bollobás; H.R. Hind

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
959 KB
Volume
74
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new upper bound for the harmonious chr
A new upper bound for the harmonious chromatic number
✍ Edwards, Keith 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB 👁 2 views

A harmonious coloring of a simple graph G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colors in such a coloring. We obtain a new upper bound for the harmonious chromatic number of general

A new upper bound on the cyclic chromati
A new upper bound on the cyclic chromatic number
✍ O. V. Borodin; H. J. Broersma; A. Glebov; J. van den Heuvel 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 1 views

## Abstract A cyclic coloring of a plane graph is a vertex coloring such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a graph is its cyclic chromatic number χ^__c__^. Let Δ^\*^ be the maximum face degree of a graph. There exist

A new upper bound for the independence n
A new upper bound for the independence number of edge chromatic critical graphs
✍ Rong Luo; Yue Zhao 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 2 views

In 1968, Vizing conjectured that if G is a -critical graph with n vertices, then (G) ≤ n / 2, where (G) is the independence number of G. In this paper, we apply Vizing and Vizing-like adjacency lemmas to this problem and prove that (G)<(((5 -6)n) / (8 -6))<5n / 8 if ≥ 6. ᭧ 2010 Wiley

Some upper bounds on the total and list
Some upper bounds on the total and list chromatic numbers of multigraphs
✍ Roland Häggkvist; Amanda Chetwynd 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 762 KB

## Abstract In this paper we discuss some estimates for upper bounds on a number of chromatic parameters of a multigraph. In particular, we show that the total chromatic number for an __n__‐order multigraph exceeds the chromatic index by the smallest __t__ such that __t__! > __n__.

An upper bound for the harmonious chroma
An upper bound for the harmonious chromatic number of a graph
✍ Sin-Min Lee; John Mitchem 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 2 views

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment of colors to the vertices of a graph such that each vertex has exactly one color has been studied for well o