A new upper bound for total colourings of graphs (Q1842182): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(94)00219-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063114607 / rank | |||
Normal rank | |||
Latest revision as of 10:03, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new upper bound for total colourings of graphs |
scientific article |
Statements
A new upper bound for total colourings of graphs (English)
0 references
26 October 1995
0 references
This paper improves on an earlier paper by the author together with the reviewer, and presents a new upper bound for the total chromatic number \(\chi_ T\) of a graph, which is of interest for small values of the (vertex) chromatic number \(\chi\). It is shown that \(\chi_ T\leq \chi_ e+ \lceil \chi/3\rceil+ 1\), where \(\chi_ e\) denotes the edge chromatic number.
0 references
total colouring
0 references
upper bound
0 references
total chromatic number
0 references
