Two sufficient conditions for a graph to be type 1.

zbMATH Open1164.05364MaRDI QIDQ5492571FDOQ5492571

Authors: Jian-Liang Wu, Ping Wang, A. J. W. Hilton 

Publication date: 16 October 2006

Recommendations

• Total colouring of some Cartesian and direct product graphs
• scientific article; zbMATH DE number 1286508
• scientific article; zbMATH DE number 2077682
• Total colorings of some join graphs
• Total colorings of product graphs

zbMATH Keywords

graphstotal colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• Total colouring of some Cartesian and direct product graphs
• Title not available (Why is that?)
• On total coloring the direct product of cycles and bipartite direct product of graphs
• On the total chromatic number of the direct product of cycles and complete graphs

This page was built for publication: Two sufficient conditions for a graph to be type \(1\).

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