On the total chromatic number of the direct product of cycles and complete graphs
From MaRDI portal
Publication:6550907
DOI10.1051/RO/2024045zbMATH Open1540.05055MaRDI QIDQ6550907
L. A. B. Kowada, Caroline S. R. Patrão, Celina M. H. de Figueiredo, Diana Sasaki, Diane Castonguay, Mario Valencia-Pabon
Publication date: 5 June 2024
Published in: RAIRO. Operations Research (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The total chromatic number of graphs having large maximum degree
- Total colorings of product graphs
- Generalization of two results of Hilton on total-colourings of a graph
- Total chromatic number of regular graphs of odd order and high degree
- On the total coloring of certain graphs
- On total coloring the direct product of cycles and bipartite direct product of graphs
- Total Colourings of Direct Product Graphs
- The Total Chromatic Number of Graphs of High Minimum Degree
- The Colour Numbers of Complete Graphs
- Hamiltonian decompositions of products of cycles
- On an estimate of the chromatic class of a \(p\)-graph
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)
