Total colorings of product graphs

DOI10.1007/s00373-018-1876-xzbMath1388.05065OpenAlexW2792907414MaRDI QIDQ1743686

J. Geetha, Kanagasabapathi Somasundaram

Publication date: 13 April 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1876-x

zbMATH Keywords

strong productdirect producttotal coloringlexicographic productproduct graphs

Mathematics Subject Classification ID

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

Related Items (6)

Total colorings-a survey ⋮ On total coloring the direct product of cycles and bipartite direct product of graphs ⋮ Unnamed Item ⋮ Total coloring conjecture for certain classes of graphs ⋮ Total colorings of certain classes of lexicographic product graphs ⋮ Total Colourings of Direct Product Graphs

Cites Work

• Graph multiplication
• On total chromatic number of direct product graphs
• Equitable total coloring of \(C_m\square C_n\)
• Total chromatic numbers
• Total colouring regular bipartite graphs is NP-hard
• Behzad-Vizing conjecture and Cartesian-product graphs
• Total colourings of graphs
• The total chromatic number of some bipartite graphs
• Total colourings of Cartesian products
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Total colorings of product graphs