A checkerboard problem and modular colorings of graphs

MaRDI QIDQ3567535zbMATH OpenFDO

Authors Futaba Okamoto, Ebrahim Salehi, Ping Zhang

Publication date 17 June 2010

zbMATH Keywords

modular coloringmodular chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Efficient computation of the modular chromatic numbers of trees
• Modular coloring of the Cartesian products \(K_m \square K_n\), \(K_m \square C_n\), and \(K_m \square P_n\)
• Modular chromatic number of \(C_m \square P_n\)
• On modular chromatic indexes of graphs
• On modular colorings of caterpillars

Cited in

(7)

• An interactive solution to the n x n mutilated checkerboard problem
• Excluded checkerboard colourable ribbon graph minors
• On modular colorings of caterpillars
• Modular chromatic number of \(C_m \square P_n\)
• Modular coloring of the Cartesian products \(K_m \square K_n\), \(K_m \square C_n\), and \(K_m \square P_n\)
• On modular edge-graceful graphs
• The signal detection problem: closed modular colorings on grid graphs

This page was built for publication: A checkerboard problem and modular colorings of graphs

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