✦ LIBER ✦

An upper bound for the total chromatic number

✍ Scribed by H. R. Hind

Book ID: 105309179
Publisher: Springer Japan
Year: 1990
Tongue: English
Weight: 379 KB
Volume: 6
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01787726

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the total chromatic n

An upper bound for the total chromatic number of dense graphs

✍ H. R. Hind 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 340 KB 👁 1 views

## Abstract In this paper we consider those graphs that have maximum degree at least 1/__k__ times their order, where __k__ is a (small) positive integer. A result of Hajnal and Szemerédi concerning equitable vertex‐colorings and an adaptation of the standard proof of Vizing's Theorem are used to s

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

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 for the list chromatic

A new upper bound for the list chromatic number

✍ B. Bollobás; H.R. Hind 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 959 KB

A Bound on the Total Chromatic Number

✍ Michael Molloy; Bruce Reed 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 481 KB

On an upper bound for the harmonious chr

On an upper bound for the harmonious chromatic number of a graph

✍ Zhikang Lu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph that has been given by Sin‐Min Lee and John Mitchem is improved.