scientific article; zbMATH DE number 169493

MaRDI QIDQ4038197zbMATH OpenFDO

Authors Liang Sun

Publication date 16 May 1993

zbMATH Keywords

chromatic numberdegreeindependent setmultipartite graphtotal coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 742644
• An upper bound for total colouring of graphs
• Total-colorings of complete multipartite graphs using amalgamations
• The total chromatic number of complete multipartite graphs with low deficiency
• An upper bound for the total chromatic number of dense graphs

Cited in

(10)

• On the chromaticity of complete multipartite graphs with certain edges added
• Partial DP-coloring of graphs
• Total colorings of some multi-join graphs
• scientific article; zbMATH DE number 4160758 (Why is no real title available?)
• scientific article; zbMATH DE number 5556311 (Why is no real title available?)
• scientific article; zbMATH DE number 4053646 (Why is no real title available?)
• On Colouring Partial Joins of a Complete Graph and a Cycle
• scientific article; zbMATH DE number 742644 (Why is no real title available?)
• Total coloring of the prismatic graphs
• The total chromatic number of complete multipartite graphs with low deficiency

This page was built for publication:

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