On total chromatic number of direct product graphs

DOI10.1007/s12190-009-0296-8zbMath1222.05073OpenAlexW1996599730MaRDI QIDQ980443

Katja Prnaver, Blaž Zmazek

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

zbMATH Keywords

tensor productdirect producttotal chromatic numbertotal coloring

Mathematics Subject Classification ID

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

Related Items (5)

Total colorings-a survey ⋮ On total coloring the direct product of cycles and bipartite direct product of graphs ⋮ Total colorings of product graphs ⋮ Total coloring conjecture for certain classes of graphs ⋮ Total colorings of certain classes of lexicographic product 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

This page was built for publication: On total chromatic number of direct product graphs