On total coloring the direct product of cycles and bipartite direct product of graphs

DOI10.1016/j.disc.2023.113340OpenAlexW4321381759MaRDI QIDQ2699911

Yanyan Li

Publication date: 20 April 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2023.113340

zbMATH Keywords

direct producttotal coloringcycle graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• On total chromatic number of direct product graphs
• Equitable total coloring of \(C_m\square C_n\)
• The total coloring of a multigraph with maximal degree 4
• Total colouring regular bipartite graphs is NP-hard
• Behzad-Vizing conjecture and Cartesian-product graphs
• Total colorings of product graphs
• Total colourings of graphs
• Total chromatic number of regular graphs of odd order and high degree
• Counterexamples to Hedetniemi's conjecture
• On the Anderson-Lipman conjecture and some related problems
• 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

This page was built for publication: On total coloring the direct product of cycles and bipartite direct product of graphs