Total chromatic number of one kind of join graphs (Q2501562): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Colour Numbers of Complete Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4873806 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5181716 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A total-chromatic number analogue of Plantholt's theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3715121 / rank | |||
Normal rank |
Latest revision as of 20:26, 24 June 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