On the total chromatic number of the direct product of cycles and complete graphs
From MaRDI portal
Publication:6550907
Recommendations
Cites work
- Generalization of two results of Hilton on total-colourings of a graph
- Hamiltonian decompositions of products of cycles
- scientific article; zbMATH DE number 4173021 (Why is no real title available?)
- scientific article; zbMATH DE number 4108788 (Why is no real title available?)
- On an estimate of the chromatic class of a \(p\)-graph
- On the total coloring of certain graphs
- On total coloring the direct product of cycles and bipartite direct product of graphs
- The Colour Numbers of Complete Graphs
- The total chromatic number of graphs having large maximum degree
- The Total Chromatic Number of Graphs of High Minimum Degree
- Total chromatic number of regular graphs of odd order and high degree
- Total colorings of product graphs
- Total colouring of some Cartesian and direct product graphs
This page was built for publication: On the total chromatic number of the direct product of cycles and complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550907)