scientific article; zbMATH DE number 7814386

DOI10.22049/cco.2022.27736.1333MaRDI QIDQ6150943

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

Publication date: 7 March 2024

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

total coloringlexicographic productdeleted lexicographic product

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Total coloring of certain classes of product graphs
• Determining the total colouring number is NP-hard
• 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
• On the total coloring of planar graphs.
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Total colorings of certain classes of lexicographic product graphs

This page was built for publication: