Indexed metadata
An Improvement of Hind's Upper Bound on the Total Chromatic Number
Amanda Chetwynd, Roland Häggkvist
Source record
Source: Crossref
Published: Jun 1, 1996
DOI: 10.1017/s0963548300001899
Open original source ↗Source abstract
We show that the total chromatic number of a simple k -chromatic graph exceeds the chromatic index by at most 18 k ⅓ log ½ 3 k .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.