Modular colorings of join of two special graphs

DOI10.5614/EJGTA.2014.2.2.6MaRDI QIDQ5177043zbMATH OpenOpenAlexFDO

Authors N. Paramaguru, R. Sampathkumar

Publication date 5 March 2015

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/ejgta.2014.2.2.6

zbMATH Keywords

join of two graphsmodular chromatic numbermodular coloring

Mathematics Subject Classification ID

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

Recommendations

• Modular coloring of the Cartesian products \(K_m \square K_n\), \(K_m \square C_n\), and \(K_m \square P_n\)
• Which graphs are modular k-colorable?
• On modular monochromatic colorings of graphs
• On modular chromatic indexes of graphs
• Modular edge colorings of Mycielskian graphs

Cited in

(7)

• On modular monochromatic colorings of graphs
• Which graphs are modular k-colorable?
• On modular colorings of caterpillars
• Modular coloring of the Cartesian products \(K_m \square K_n\), \(K_m \square C_n\), and \(K_m \square P_n\)
• On modular monochromatic (2,0)-colorings
• Modular chromatic number of C_m P_n
• The modular chromatic number of Cartesian product and join of graphs

This page was built for publication: Modular colorings of join of two special graphs

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