On Equitable Coloring of Central Graphs and Total Graphs

DOI10.1016/j.endm.2009.03.001zbMath1267.05227OpenAlexW1991925535MaRDI QIDQ2839223

J. Vernold Vivin, K. Kaliraj, M. M. Ali Akbar

Publication date: 4 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

equitable chromatic numbertotal graphequitable coloringcentral graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Equitable chromatic number of weak modular product of Some graphs ⋮ On equitable chromatic number of Tadpole graph T_{m,n} ⋮ Equitable critical graphs ⋮ Equitable coloring on total graph of bigraphs and central graph of cycles and paths ⋮ Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs

Cites Work

• Equitable colorings of bounded treewidth graphs
• On equitable \(\Delta\)-coloring of graphs with low average degree
• Equitable coloring of trees
• On equitable coloring of bipartite graphs
• Graph Colorings
• Circular chromatic number: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item