No label defined (Q4943291)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1416070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1416070 |
Statements
22 June 2000
0 references
total chromatic number
0 references
unbalanced complete multipartite graph
0 references
total coloring conjecture
0 references
0.8676605224609375
0 references
0.8517281413078308
0 references
0.8465686440467834
0 references
0.822737991809845
0 references
0.822737991809845
0 references
A graph \(G\) is called type \(i\) if \(\chi _{T}(G)=\Delta (G)+i\), where \(\chi _{T}(G)\) is the total chromatic number of \(G\) and a complete \(r\)-partite graph \(K(p_{1},p_{2},\ldots ,p_{r})\) is called balanced if \(p_{1}=p_{2}= \ldots =p_{r}\); otherwise it is unbalanced. It is well known that any complete \(r\)-partite graph \(G\) satisfies the total coloring conjecture, i.e., \(\chi _{T}(G)\leq \Delta (G)+2\). In this note, besides other results, it is proved that every unbalanced complete 4-partite graph of even order is of type 1 and if \(G=K(p_{1},p_{2},\ldots ,p_{r})\), where \(p_{1}\leq p_{2}\leq \ldots \leq p_{r}\), \(|V(G)|=2n\) and \(p_{2}\leq p_{3}-2\), then \(G\) is also type 1.
0 references