Total chromatic number of one kind of join graphs (Q2501562): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.03.056 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2071310769 / rank | |||
Normal rank |
Revision as of 19:34, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Total chromatic number of one kind of join graphs |
scientific article |
Statements
Total chromatic number of one kind of join graphs (English)
0 references
14 September 2006
0 references
A total \(k\)-coloring of a graph \(G=(V,E)\) is an assigment of \(k\) colors to the elements of \(V\cup E\) such that incident elements receive different colors. The total chromatic number \(\chi_T(G)\) of \(G\) is the smallest integer \(k\) for which \(G\) admits a total \(k\)-coloring. The join of two (disjoint) graphs \(G\) and \(H\) is obtained from \(G\cup H\) by adding new edges \(xy\) between all vertices \(x\) in \(G\) and an \(y\) in \(H\). The authors prove that \(\chi_T(G) =\Delta(G) + 1\) whenever \(G\) is the join of a complete bipartite graph and a path (\(\Delta(G)\) denotes the maximum vertex degree in \(G\)).
0 references