Total coloring of certain classes of product graphs

DOI10.1016/j.endm.2016.05.016zbMath1347.05167OpenAlexW2514386466MaRDI QIDQ327644

Mohammad Hasan, M. Dambrine

Publication date: 19 October 2016

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

zbMATH Keywords

bipartite graphscomplete graphstotal coloringproduct graphcompound graph

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Total coloring conjecture for certain classes of graphs ⋮ Total colorings of certain classes of lexicographic product graphs

Cites Work

• The total chromatic number of graphs having large maximum degree
• Determining the total colouring number is NP-hard
• The total coloring of a multigraph with maximal degree 4
• Total colouring regular bipartite graphs is NP-hard
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Roots of independence polynomials of well covered graphs
• On the total coloring of certain graphs
• Grands Graphes De Degré Et Diamètre Fixés
• New largest known graphs of diameter 6
• On the total coloring of planar graphs.
• On large (Δ, 6)-Graphs
• Two new families of large compound graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• On Total Chromatic Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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