Total coloring of certain classes of product graphs
From MaRDI portal
Publication:327644
DOI10.1016/J.ENDM.2016.05.016zbMATH Open1347.05167OpenAlexW2514386466MaRDI QIDQ327644FDOQ327644
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
Recommendations
Cites Work
- Roots of independence polynomials of well covered graphs
- Handbook of product graphs
- The total chromatic number of any multigraph with maximum degree five is at most seven
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- On Total Chromatic Number of a Graph
- 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
- Grands Graphes De Degré Et Diamètre Fixés
- New largest known graphs of diameter 6
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On large (Δ, 6)-Graphs
- Hierarchical organization of modularity in complex networks
- Two new families of large compound graphs
- The total chromatic number of graphs having large maximum degree
Cited In (10)
- Total colorings of certain classes of lexicographic product graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total coloring for generalized Sierpiński graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- \([r,s,t]\)-colorings of graph products
- Total coloring conjecture for certain classes of graphs
- Coloring fiber product of graphs
- Title not available (Why is that?)
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)