On equitable colouring of Knödel graphs

DOI10.1080/00207160.2013.847181zbMath1305.05078OpenAlexW2041883451MaRDI QIDQ2935368

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

Publication date: 29 December 2014

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2013.847181

zbMATH Keywords

line graphKnödel graphcentral graphcorona graphequitable colouring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A fast algorithm for equitable coloring
• Equitable colorings of bounded treewidth graphs
• New gossips and telephones
• Equitable coloring of trees
• A survey on Knödel graphs.
• Recognizing Knödel graphs
• On equitable coloring of bipartite graphs
• On the corona of two graphs
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• An Efficient Vertex Addition Method for Broadcast Networks
• On the minimum path problem in Knödel graphs
• A Note on the Dimensionality of Modified Knödel Graphs
• Equitable Coloring
• Graph Colorings
• Minimum multiple message broadcast graphs

This page was built for publication: On equitable colouring of Knödel graphs