𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Copositive programming motivated bounds on the stability and the chromatic numbers

✍ Scribed by Igor Dukanovic; Franz Rendl

Book ID
106275847
Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
274 KB
Volume
121
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Bound on the Total Chromatic Number
A Bound on the Total Chromatic Number
✍ Michael Molloy; Bruce Reed πŸ“‚ Article πŸ“… 1998 πŸ› Springer-Verlag 🌐 English βš– 481 KB
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__.