Total coloring of certain classes of product graphs

DOI10.1016/J.ENDM.2016.05.016MaRDI QIDQ327644zbMATH OpenOpenAlexFDO

Authors S. Mohan, J. Geetha, K. Somasundaram

Publication date 19 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2016.05.016

zbMATH Keywords

product graphtotal coloringbipartite graphscomplete graphscompound graph

Mathematics Subject Classification ID

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

Recommendations

• Total colorings of product graphs
• scientific article; zbMATH DE number 6813611
• Recent developments in total colouring
• Total coloring conjecture on certain classes of product graphs
• Total coloring conjecture for vertex, edge and neighborhood corona products of graphs

Cites work

• scientific article; zbMATH DE number 3859160 (Why is no real title available?)
• scientific article; zbMATH DE number 4150186 (Why is no real title available?)
• scientific article; zbMATH DE number 3939392 (Why is no real title available?)
• scientific article; zbMATH DE number 2077682 (Why is no real title available?)
• scientific article; zbMATH DE number 6004 (Why is no real title available?)
• scientific article; zbMATH DE number 3893253 (Why is no real title available?)
• Determining the total colouring number is NP-hard
• Grands Graphes De Degré Et Diamètre Fixés
• Handbook of product graphs
• Hierarchical organization of modularity in complex networks
• New largest known graphs of diameter 6
• On Total Chromatic Number of a Graph
• On large (Δ, 6)-Graphs
• On the total coloring of certain graphs
• On the total coloring of planar graphs.
• Roots of independence polynomials of well covered graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• The total chromatic number of any multigraph with maximum degree five is at most seven
• The total chromatic number of graphs having large maximum degree
• The total coloring of a multigraph with maximal degree 4
• Total colouring regular bipartite graphs is NP-hard
• Two new families of large compound graphs

Cited in

(10)

• Total colorings of certain classes of lexicographic product graphs
• scientific article; zbMATH DE number 6277727 (Why is no real title available?)
• Coloring fiber product of graphs
• Total coloring for generalized Sierpiński graphs
• \([r,s,t]\)-colorings of graph products
• scientific article; zbMATH DE number 6813611 (Why is no real title available?)
• Total chromatic number for certain classes of lexicographic product graphs
• Total coloring conjecture for certain classes of graphs
• scientific article; zbMATH DE number 2077682 (Why is no real title available?)
• scientific article; zbMATH DE number 1839762 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327644)