The metric chromatic number of a graph

MaRDI QIDQ3635528zbMATH OpenFDO

Authors Gary Chartrand, Futaba Okamoto, Ping Zhang

Publication date 6 July 2009

zbMATH Keywords

chromatic numbervertex coloringmetric chromatic numbermetric color code

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• The metric chromatic number of zero divisor graph of a ring \(\mathrm{Z_n} \)
• A Chromatic Metric on Graphs
• The \(k\)-metric colorings of a graph.
• The singular chromatic number of a graph.
• The set chromatic number of a graph

Cited in

(8)

• On the strong partition dimension of graphs
• A Chromatic Metric on Graphs
• On the set chromatic number of the middle graph of extended stars and related tree families
• On the locating chromatic number of Kneser graphs
• A bound for the locating chromatic number of trees
• Further new results on strong resolving partitions for graphs
• The Edge Partition Dimension of Graphs
• The metric chromatic number of zero divisor graph of a ring \(\mathrm{Z_n} \)

This page was built for publication: The metric chromatic number of a graph

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