Total chromatic number of graphs of odd order and high degree (Q1301827): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:51, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Total chromatic number of graphs of odd order and high degree |
scientific article |
Statements
Total chromatic number of graphs of odd order and high degree (English)
0 references
12 September 1999
0 references
It is proved that if a simple graph \(G\) has odd order \(|V(G)|\), minimum degree \(\delta(G)\) and \(r(G)\) vertices of maximum degree \(\Delta(G)\) such that \(\Delta(G)+ \delta(G)\geq 3/2 |V(G)|+ r(G)+ 5/2\), then \(\chi_T(G)= \Delta(G)+ 1\), where \(\chi_T(G)\) is the total chromatic number of \(G\).
0 references
total chromatic number
0 references
