On total chromatic number of direct product graphs
From MaRDI portal
Publication:980443
DOI10.1007/s12190-009-0296-8zbMath1222.05073MaRDI QIDQ980443
Publication date: 29 June 2010
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-009-0296-8
Related Items
Total colorings of certain classes of lexicographic product graphs, Total colorings-a survey, Total colorings of product graphs, Total coloring conjecture for certain classes of graphs, On total coloring the direct product of cycles and bipartite direct product of graphs
Cites Work
- A result on the total colouring of powers of cycles
- Determining the total colouring number is NP-hard
- Total colorings of planar graphs without adjacent triangles
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- Total colouring regular bipartite graphs is NP-hard
- Behzad-Vizing conjecture and Cartesian-product graphs
- Total colourings of graphs