Total colorings of some join graphs

MaRDI QIDQ2747198zbMATH OpenFDO

Authors Jiping Liu, Cheng Zhao

Publication date 21 April 2002

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

colouringfinite simple graphjoin graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Review text

The authors consider simultaneous colourings of the vertices and edges of a finite simple graph \(G\) so that no two edges incident with the same vertex receive the same colour, no two adjacent vertices receive the same colour, and no incident edge and vertex receive the same colour. \(\chi_T(G)\) means the least number of colours needed for such type of colouring of \(G\). A graph \(G\) is called Type 1 if \(\chi_T(G)= \Delta(G)+ 1\) and Type 2 if \(\chi_T(G)= \Delta(G)+2\), where \(\Delta(G)\) is the maximum vertex degree of \(G\). The authors classify the join graphs of the form \(G_1+ G_2\), where \(G_1\) and \(G_2\) are graphs with maximum degree at most 2, according to Type 1 (Type 2).

Recommendations

• Total colorings of some multi-join graphs
• Total chromatic number of one kind of join graphs
• On the equitable total coloring of some join-graphs
• Join colourings of chordal graphs
• Edge-colouring of join graphs
• TOTAL COLORING OF CERTAIN GRAPHS
• Incidence coloring of the join graphs
• Equitable total coloring of some join graphs
• On Colouring Partial Joins of a Complete Graph and a Cycle
• scientific article; zbMATH DE number 4134070

Cited in

(11)

• Edge-colouring of join graphs
• Total chromatic number of one kind of join graphs
• Total colorings of some multi-join graphs
• On the total coloring of the join graph of a fan and a complete balanced bipartite graph
• On Colouring Partial Joins of a Complete Graph and a Cycle
• scientific article; zbMATH DE number 653278 (Why is no real title available?)
• scientific article; zbMATH DE number 979983 (Why is no real title available?)
• scientific article; zbMATH DE number 1998288 (Why is no real title available?)
• scientific article; zbMATH DE number 6277727 (Why is no real title available?)
• Two sufficient conditions for a graph to be type 1.
• A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs

This page was built for publication: Total colorings of some join graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747198)