Total colorings of certain classes of lexicographic product graphs

DOI10.1142/S1793830921501299zbMath1487.05099OpenAlexW3152976075MaRDI QIDQ5866032

T. P. Sandhiya, J. Geetha, Kanagasabapathi Somasundaram

Publication date: 10 June 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921501299

zbMATH Keywords

total coloringlexicographic productdeleted lexicographic product

Mathematics Subject Classification ID

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

Related Items (3)

Total colorings-a survey ⋮ Total coloring conjecture on certain classes of product graphs ⋮ Unnamed Item

Cites Work

• Total coloring of certain classes of product graphs
• Graph multiplication
• On total chromatic number of direct product graphs
• Total chromatic numbers
• Total colouring regular bipartite graphs is NP-hard
• Total colorings of product graphs
• Total colourings of graphs
• Equistable graphs, general partition graphs, triangle graphs, and graph products
• Total coloring conjecture for certain classes of graphs
• Total colourings of Cartesian products
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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